On the role of bounds in stochastic linear programming
From MaRDI portal
Publication:4484947
DOI10.1080/02331930008844482zbMath0963.90045OpenAlexW2080489201MaRDI QIDQ4484947
Publication date: 5 June 2000
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930008844482
Uses Software
Cites Work
- Unnamed Item
- Descent directions and efficient solutions in discretely distributed stochastic programs
- Estimated stochastic programs with chance constraints
- The augmented system variant of IPMs in two-stage stochastic linear programming computation
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- A simulation-based approach to two-stage stochastic programming with recourse
- Approximations to stochastic programs with complete fixed recourse
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- On Optimal Allocation of Indivisibles Under Uncertainty
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- New Second-Order Bounds on the Expectation of Saddle Functions with Applications to Stochastic Linear Programming
- Solving stochastic programming problems with recourse including error bounds
This page was built for publication: On the role of bounds in stochastic linear programming