Bound‐based approximations in multistage stochasticprogramming: Nonanticipativity aggregation
Author:
- 1 January 1999
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 85, 103-127
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- PrefaceAnnals of Operations Research, 1995
- Parallel decomposition of multistage stochastic programming problemsMathematical Programming, 1993
- An upper bound on the expectation of simplicial functions of multivariate random variablesMathematical Programming, 1992
- Stochastic Two-Stage Programming1992
- Parallel processors for planning under uncertaintyAnnals of Operations Research, 1990
- Mslip: A computer code for the multistage stochastic linear programming problemMathematical Programming, 1990
- Sublinear upper bounds for stochastic programs with recourseMathematical Programming, 1989
- An L-Shaped Method Computer Code for Multi-Stage Stochastic Linear Programs1988
- Numerical Techniques for Stochastic Optimization1988
- A regularized decomposition method for minimizing a sum of polyhedral functionsMathematical Programming, 1986