Article ID: | iaor1991725 |
Country: | Netherlands |
Volume: | 47 |
Issue: | 3 |
Start Page Number: | 407 |
End Page Number: | 423 |
Publication Date: | Aug 1990 |
Journal: | Mathematical Programming (Series A) |
Authors: | Gassmann Horand I. |
This paper describes an efficient implementation of a nested decomposition algorithm for the multistage stochastic linear programming problem. Many of the computational tricks developed for deterministic staircase problems are adapted to the stochastic setting and their effect on computation times is investigated. The computer code supports an arbitrary number of time periods and various types of random structures for the input data. Numerical results compare the performance of the algorithm to MINOS 5.0.