Aggregation bounds in stochastic linear programming
From MaRDI portal
Publication:3675909
DOI10.1007/BF02591859zbMath0562.90066MaRDI QIDQ3675909
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
90C15: Stochastic programming
Related Items
Parallel processors for planning under uncertainty, Solving many linear programs that differ only in the right-hand side, Improving aggregation bounds for two-stage stochastic programs, Duality and statistical tests of optimality for two stage stochastic programs, Aggregation and discretization in multistage stochastic programming, Hydroelectric reservoir optimization in a pool market, Multistage stochastic convex programs: duality and its implications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximations to stochastic programs with complete fixed recourse
- Inequalities for Stochastic Linear Programming Problems
- Linear Programming under Uncertainty
- Bounds on the Effect of Aggregating Variables in Linear Programs
- Bounds for Row-Aggregation in Linear Programming
- Technical Note—Improved Bounds for Aggregated Linear Programs
- Duality for Stochastic Programming Interpreted as L. P. in $L_p $-Space
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming