Unanswered Questions
73 questions with no upvoted or accepted answers
11
votes
0
answers
164
views
Characterizing the solution of a (non) linear maximization program
I have the following maximization program
\begin{align}
\max\limits_{\{q_i\}}&\quad\sum\limits_{i=1}^nq_i \\
\text{s.t.}&\quad\begin{cases} k_j \geq \sum\limits_{i=1}^n q_i^{1 \over \...
- 591
9
votes
0
answers
230
views
Solving large-scale stochastic mixed integer program
What are some methods or algorithms for solving a large-scale stochastic mixed-integer optimization problem that runs on an hourly dataset for a year? Do we employ some kind of decomposition? (the ...
- 1,687
6
votes
0
answers
226
views
Airline revenue management re-solving problem
I am considering a bid prices (shadow price of the capacity constraint) problem (from Chen, L. and Homem-de Mello, T. (2009)., page 14) where the acceptable classes for booking requests for ...
- 165
6
votes
0
answers
95
views
Sample Average Approximation vs. Numerical Integration
In the sense of the calculation of the expected value of objective functions, we have two choices to evaluate the value; 1. Sample Average Approximation (SAA):
$$
\frac{1}{N}\sum_{i=1}^N f(x,\xi^i).
$$...
- 155
6
votes
0
answers
127
views
Water quality component optimization
I have an optimization problem that I'm attempting to tackle. As you can see in the image below, there's a graph network through which water flows. I've drawn out the problem in the image to explain ...
- 5,874
5
votes
0
answers
553
views
How to write this objective in CVXPY for quasiconvex programming?
I have the following objective that I want to maximize:
\begin{equation}
\max_{U_T\in \mathbb{R}, x\in\mathbb{R}^T} J_\alpha(U_T) = \frac{\alpha}{\alpha-1}\log\left(\frac{\cosh(U_T)}{\cosh(\alpha U_T)^...
- 86
5
votes
0
answers
154
views
Chance constrained optimization - interpretation
Suppose that we have a stochastic vector $\psi$ and $S$ realisations of $\psi$ given by $\psi_1,\dots,\psi_S$ with equal probability of occurrence. In addition, we have constraints of the form
\begin{...
- 2,463
5
votes
0
answers
135
views
Is there a way to use lazy constraints with Baron?
I am solving a non-linear mixed-integer programme with BARON. The objective function looks like $\big( \sum_i x_i \big) \cdot \big(\prod_i e^{-y_i}\big)$ (binary $x$ and real-valued $y$) and it has ...
- 2,123
5
votes
0
answers
44
views
In a binary logistic regression context, how to introduce a constraint to model the dependency between consecutive samples
Imagine we are running a logistic regression to identify opportunities for car sale promotion, using previous promotion campaign's result. Each $y$ is the increase of car sale after the promotion.
...
- 5,442
4
votes
0
answers
107
views
How to linearize or convexify a constraint with a square root of sum of two variables?
Here is the constraint:
$$\text{Pa} + \text{Pb}=a + b \sqrt{\text{Ir}^2 +\text{Ii}^2} + c (\text{Ir}^2 +\text{Ii}^2)$$
Here $\text{Pa}, \text{Pb}, \text{Ir},$ and $\text{Ii}$ are variables. $a, b, c$ ...
- 5,442
4
votes
0
answers
164
views
Stochastic optimization for inventory management
The deterministic problem is to minimize operational cost subject to constraints in demand, supply and capacity. The ordering policy is periodic review, order-up-to.
The stochastic version of the ...
- 1,895
4
votes
0
answers
36
views
Does knowing the "correct multipliers" for globally optimal first-order critical points help you algorithmically?
Consider the following nonlinear optimization problem:
\begin{align*}
&\min f(x) \\
\text{such that } &h_1(x) = 0, \\
&h_2(x) = 0, \\
& \vdots \\
& h_m(x) = 0,
\end{align*}
where $...
- 1,895
4
votes
0
answers
288
views
Linearize a highly non-linear objective function
[EDIT] : The formula below is updated to remove the radical, 0.5 in the term $(I_{i,v} \cdot \Delta t)$ and constant temperature $T$ replces temperature as function of current.
[EDIT] :The values of ...
- 349
4
votes
0
answers
54
views
How to find range of values for the first-stage decisions resulting in the same cuts in two-stage stochastic programming?
Suppose we have a two-stage stochastic program as follows:
\begin{equation}
\begin{split}
\min \ & c^Tx + \mathbb{E}_\xi[Q(x,\xi)] \\
& \text{where}\\
&Q(x,\xi)=\min q(\xi)^Ty\\
&Tx+...
- 2,160
4
votes
0
answers
73
views
How can non-polyhedral sets be investigated?
To derive problem-specific cutting planes for some given problem (think something like TSP problem), one common way is to study small examples. To this end, one can create small instances for the ...
- 2,986