Solving multistage stochastic networks: An application of scenario aggregation
Authors:
Abstract
The scenario aggregation algorithm is specialized for stochastic networks. The algorithm determines a solution that does not depend on hindsight and accounts for the uncertain environment depicted by a number of appropriately weighted scenarios. The solution procedure decomposes the stochastic program to its constituent scenario subproblems, thus preserving the network structure. Computational results are reported demonstrating the algorithm's convergence behavior. Acceleration schemes are discussed along with termination criteria. The algorithm's potential for execution on parallel multiprocessors is discussed.Keywords
This publication has 28 references indexed in Scilit:
- The Aggregation Principle in Scenario Analysis and Stochastic Optimization1989
- On stochastic programming ii: dynamic problems under risk∗Stochastics, 1988
- A multicut algorithm for two-stage stochastic linear programsEuropean Journal of Operational Research, 1988
- Nonlinear programming on generalized networksACM Transactions on Mathematical Software, 1987
- Decomposition and Partitioning Methods for Multistage Stochastic Linear ProgramsOperations Research, 1985
- Forest iteration method for stochastic transportation problem1985
- Solving stochastic programs with simple recourseStochastics, 1983
- stochastic quasigradient methods and their application to system optimization†Stochastics, 1983
- The value of the stochastic solution in stochastic linear programs with fixed recourseMathematical Programming, 1982
- Stochastic transportation problems and other newtork related convex problemsNaval Research Logistics Quarterly, 1977