An effective heuristic for multistage linear programming with a stochastic right-hand side
DOI10.1016/J.COR.2014.06.010zbMATH Open1348.90500OpenAlexW2004038375MaRDI QIDQ337144FDOQ337144
Authors: R. E. Rodriguez-Ravines, C. Beltran-Royo, Laureano F. Escudero Bueno, Juan F. Monge
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.010
Recommendations
- scientific article; zbMATH DE number 4025161
- Step decision rules for multistage stochastic programming: a heuristic approach
- Stochastic linear programming method for right-hand sides random vector
- scientific article; zbMATH DE number 140509
- scientific article; zbMATH DE number 1187213
- scientific article; zbMATH DE number 1187214
- scientific article
- A new approach to stochastic linear programming
- An Interior Random Vector Algorithm for MultiStage Stochastic Linear Programs
- Efficient solution of two-stage stochastic linear programs using interior point methods
conditional expectationscenario treemultistage stochastic programmingrevenue managementconstraint aggregation
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15)
Cites Work
- Scenario tree modeling for multistage stochastic programs
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- Decomposition algorithms for stochastic programming on a computational grid
- Robust Optimization of Large-Scale Systems
- Step decision rules for multistage stochastic programming: a heuristic approach
- Aggregation and discretization in multistage stochastic programming
- Introduction to stochastic programming.
- Lectures on Stochastic Programming
- Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion
- Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming
- The Scenario Generation Algorithm for Multistage Stochastic Linear Programming
- Epi-convergent discretizations of multistage stochastic programs via integration quadratures
- Title not available (Why is that?)
- Approximate Dynamic Programming
- The value of the stochastic solution in multistage problems
- Aggregation bounds in stochastic linear programming
- A warm-start approach for large-scale stochastic linear programs
- Scenarios for multistage stochastic programs
- On complexity of multistage stochastic programs
- State-of-the-Art-Survey—Stochastic Programming: Computation and Applications
- A tighter variant of Jensen's lower bound for stochastic programs and separable approximations to recourse functions
- Inference of statistical bounds for multistage stochastic programming problems
- A parallel computation approach for solving multistage stochastic network problems
- Title not available (Why is that?)
- Bounds in multistage linear stochastic programming
- Primal-Dual Aggregation and Disaggregation for Stochastic Linear Programs
- Primal-dual constraint aggregation with application to stochastic programming
- Building and solving large-scale stochastic programs on an affordable distributed computing system
Cited In (2)
Uses Software
This page was built for publication: An effective heuristic for multistage linear programming with a stochastic right-hand side
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337144)