| Autor: |
Pereira, M. V. F., Pinto, L. M. V. G. |
| Zdroj: |
Mathematical Programming; May 1991, Vol. 52 Issue: 1-3 p359-375, 17p |
| Abstrakt: |
This paper presents a methodology for the solution of multistage stochastic optimization problems, based on the approximation of the expected-cost-to-go functions of stochastic dynamic programming by piecewise linear functions. No state discretization is necessary, and the combinatorial “explosion” with the number of states (the well known “curse of dimensionality” of dynamic programming) is avoided. The piecewise functions are obtained from the dual solutions of the optimization problem at each stage and correspond to Benders cuts in a stochastic, multistage decomposition framework. A case study of optimal stochastic scheduling for a 39-reservoir system is presented and discussed. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
Full text from SpringerLink