scientific article; zbMATH DE number 176392
[For the entire collection see Zbl 0753.00017.] The paper demonstrates how a common class of stochastic models, namely the large-scale stochastic linear programs with recourse can be efficiently solved by using a blending of the classical Benders decomposition with a relatively new technique called importance sampling. A stochastic linear program breaks down into two parts: a deterministic dynamic part (master-problem) and a stochastic part. The master-problem is a dynamic linear program with \(T\) stages. Each stage is associated with a stochastic sub-problem. The sub-problems in each stage are assumed to be stochastically independent. The sub-problem costs \(f_ t\) and the technology matrix \(D_ t\) (\(t =1,\dots,T\)) are assumed to be deterministic parameters. The master-problem is optimized to obtain an approximate optimal feasible solution that is used as input to the sub- problems. Lower and upper confidence bounds to the problem are computed. Monte Carlo methods are recommended to compute multiple integrals or multiple sums arising in large-scale stochastic problems. The code of the subroutine MINOS has been adapted for solving both the master-problem and the sub-problems. Numerical results of large-scale problems in the area of expansion planning of power systems and financial planning are presented. These numerical results of large problems with numerous stochastic parameters indicate that very accurate solutions of the problems can be obtained using only small sample sizes.
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- scientific article; zbMATH DE number 4108484
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- scientific article; zbMATH DE number 679873
- Statistical approximations for stochastic linear programming problems
- Enhancements of two-stage stochastic decomposition
- Convergent bounds for stochastic programs with expected value constraints
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Intelligent control and optimization under uncertainty with application to hydro power
- Modelling and analysis of multistage stochastic programming problems: A software environment
- Statistical approximations for stochastic linear programming problems
- Multi-stage stochastic linear programs for portfolio optimization
- A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning
- Scalable parallel Benders decomposition for stochastic linear programming
- A polyhedral study of the static probabilistic lot-sizing problem
- A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs
- Aggregation and discretization in multistage stochastic programming
- Event tree based sampling
- The empirical behavior of sampling methods for stochastic programming
- Sequential importance sampling algorithms for dynamic stochastic programming
- A moment-matching method to generate arbitrage-free scenarios
- Importance sampling in stochastic programming: a Markov chain Monte Carlo approach
- scientific article; zbMATH DE number 679873 (Why is no real title available?)
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- A preconditioning technique for Schur complement systems arising in stochastic optimization
- The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs
- Logarithmic integral optimization via adaptive importance sampling based surrogation methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035542)