Multi-stage stochastic optimization applied to energy planning
- 3.7k Downloads
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.
KeywordsLinear Function Mathematical Method Dynamic Programming Stochastic Optimization Piecewise Linear Function
Unable to display preview. Download preview PDF.
- J.F. Benders, “Partitioning procedures for solving mixed variables programming problems,”Numerische Mathematik 4 (1962) 238–252.Google Scholar
- J.R. Birge, “Solution methods for stochastic dynamic linear programs,” Report 80/29, Systems Optimization Laboratory, Department of Operations Research, Stanford University (Stanford, CA, 1980).Google Scholar
- S. Gal, “Parameter iteration dynamic programming”,Management Science (1989).Google Scholar
- J.L. Kennington and R.V. Helgason,Algorithms for Network Programming (Wiley, New York, 1984).Google Scholar
- M.V.F. Pereira and L.M.V.G. Pinto, “Stochastic optimization of a multireservoir hydroelectric system—a decomposition approach”,Water Resources Research 21(6) (1985).Google Scholar
- R. J.-B. Wets, “Large scale linear programming techniques,” in: Y. Ermoliev and R. Wets, eds.,Numerical Methods for Stochastic Optimization (Springer, Berlin, 1988) Chapter 3.Google Scholar