Large-Scale Stochastic Linear Programs: Importance Sampling and Benders Decomposition
George B. Dantzig, Gerd Infanger · 1991
Abstract : The paper demonstrates how large-scale stochastic linear programs with recourse can be efficiently solved by using a blending of classical Benders decomposition with a relatively new technique called importance sampling. Numerical results of large-scale problems in the area of expansion planning of power systems and financial planning are presented.
Cited by 88 works. doi:10.21236/ada234962
Authors
References
- Partitioning procedures for solving mixed-variables programming problems
- Methods of Numerical Integration.
- Linear Programming Under Uncertainty
- Methods of Numerical Integration.
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- L -Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Numerical Techniques for Stochastic Optimization
- On the Solution of Two-stage Linear Programs under Uncertainty
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Importance Sampling for Stochastic Simulations