Unanswered Questions
45 questions with no upvoted or accepted answers
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 ...
6
votes
0
answers
111
views
Dual instability, degeneracy, tailing off effect - Which are the causes and which are the effects?
Dual instability, degeneracy, and the tailing off effect are often mentioned together in papers. However, I cannot seem to find a clear explanation on which of these cause the other and vice versa? ...
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 ...
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).
$$...
6
votes
0
answers
237
views
Provide basic solution to CLP
I'm using Pyomo to formulate an LP with approx 500,000 constraints and 200,000 decision variables. The LP is solved using CLP. Some instances fail to return even a feasible solution after many ...
6
votes
0
answers
100
views
Proof that the leaving variable cannot be selected as the entering one in the next round
Using the Dantzig's pivoting rule, can it be proven that the leaving variable of one round cannot be selected as the entering variable in the next round?
6
votes
0
answers
107
views
Demonstrating a given solution is basic for a MCFP?
Given a minimum-cost flow problem, how could I go about demonstrating that a specific solution (as sets of basic and non-basic (!) arcs that build a rooted spanning tree for a given graph) is basic ...
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{...
5
votes
0
answers
165
views
All optimal solutions
I have a following problem:
If I have some function $aX+bY+cZ+mD+nF$ and I want to maximize it and have some constraints, how can I find ALL solutions for this maximum value of the function?
To sum ...
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 ...
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+...
4
votes
0
answers
272
views
Does anyone have the criss cross algorithm programming code to solve linear programming problems?
I have a project that requires programming code for the simplex algorithm and criss-cross algorithm. The purpose of this project is to compare the two methods. I've tried to find it, but the ...
3
votes
0
answers
68
views
Block Simplex Algorithm, i.e., Block Active Set for Linear Programming
What investigation has there been of Block Simplex Algorithms, i.e., block active set for Linear Programming, i.e., block pivoting? This is a follow-up to Why do active set methods or the simplex ...
3
votes
0
answers
50
views
Control variables and cofounding effects in stochastic programming/,model predictive control/reinforcement learning
How can we be sure that confounding variables/control variables don’t pickup the effect our decisions w.r.t decision variables had on the actual control variable?
Since the term control variable ...
3
votes
0
answers
89
views
Derivative of sup(max) functions in distributionally robust optimization
In the distributionally robust optimization problem
\begin{aligned}
\min_{x\in X}\sup_{P\in\mathfrak{P}}\mathbb{E}_P[f(x,\xi)],
\end{aligned}
where $f:\mathbb{R}^n\to\mathbb{R}$ and $P$ is a ...