Solving many linear programs that differ only in the right-hand side
From MaRDI portal
Publication:1108193
DOI10.1016/0377-2217(88)90193-2zbMath0653.90044OpenAlexW2066609246MaRDI QIDQ1108193
Stein W. Wallace, Dag Haugland
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90193-2
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Stochastic programming (90C15)
Related Items
Algorithms for the solution of stochastic dynamic minimax problems, Solving linear programs with multiple right-hand sides: Pricing and ordering schemes, Scenario tree construction driven by heuristic solutions of the optimization problem, Finding and identifying optimal inventory levels for systems with common components, Accelerating the regularized decomposition method for two stage stochastic linear problems
Cites Work
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- stochastic quasigradient methods and their application to system optimization†
- Aggregation bounds in stochastic linear programming
- Decomposing the requirement space of a transporation problem into polyhedral cones
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- A piecewise linear upper bound on the network recourse function
- Investing in arcs in a network to maximize the expected max flow
- Solving stochastic programs with network recourse
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- Matrix augmentation and partitioning in the updating of the basis inverse
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Computation in Discrete Stochastic Programs with Recourse
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
