Abstract
Handling uncertainty in natural inflow is an important part of a hydroelectric scheduling model. In a stochastic programming formulation, natural inflow may be modeled as a random vector with known distribution, but the size of the resulting mathematical program can be formidable. Decomposition-based algorithms take advantage of special structure and provide an attractive approach to such problems. We develop an enhanced Benders decomposition algorithm for solving multistage stochastic linear programs. The enhancements include warm start basis selection, preliminary cut generation, the multicut procedure, and decision tree traversing strategies. Computational results are presented for a collection of stochastic hydroelectric scheduling problems.
Similar content being viewed by others
References
P.G. Abrahamson, A nested decomposition approach for solving staircase linear programs, Ph.D. Dissertation, Department of Operations Research, Stanford University, 1983.
R. Barr, K. Farhangian and J.L. Kennington, Networks with side constraints: An LU factorization update, The Annals of the Society of Logistics Engineers 1, 1986, 66–85.
J.R. Birge, Decomposition and partitioning methods for multistage stochastic linear programs, Operations Research 33, 1985, 989–1007.
J.R. Birge and F.V. Louveaux, A multicut algorithm for two-stage stochastic linear programs, European Journal of Operational Research 34, 1988, 384–392.
H.A. Eiselt, G. Pederzoli and C.-L. Sandblom,Continuous Optimization Models, W. de Gruyter, Berlin/New York, 1987.
S. Garstka and D. Rutenberg, Computation in discrete stochastic programs with recourse, Operations Research 21, 1973, 112–122.
H.I. Gassman, MSLiP: A computer code for the multistage stochastic linear programming problem, Mathematical Programming 47, 1990, 407–423.
G. Infanger,Planning under Uncertainty — Solving Large-Scale Stochastic Linear Programs, The Scientific Press Serres, Boyd and Fraser, 1993.
J.M. Jacobs, Advanced basis insertion for repeated optimization of networks with side constraints, Pacific Gas & Electric Company, 1992.
J. Jacobs, G. Freeman, J. Grygier, D. Morton, G. Schultz, K. Staschus, J. Stedinger and B. Zhang, Stochastic optimal coordination of river-basin and thermal electric systems (SOCRATES): A system for scheduling hydroelectric generation under uncertainty, Annals of Operations Research 59, 1995, 99–133.
J.L. Kennington and R.V. Helgason,Algorithms for Network Programming, Wiley, New York, 1980.
R.T. Rockafellar and R.J-B Wets, Scenarios and policy aggregation in optimization under uncertainty, Mathematics of Operations Research 16, 1991, 119–147.
A. Ruszczyński, On augmented Lagrangian decomposition methods for multistage stochastic programs, Working Paper WP-94-05, IIASA, Laxenburg, 1994.
A. Ruszczyński, Regularized decomposition of stochastic programs: Algorithmic techniques and numerical results, Working Paper WP-93-21, IIASA, Laxenburg, 1993.
A. Ruszczyński, A regularized decomposition method for minimizing a sum of polyhedral functions, Mathematical Programming 35, 1986, 309–333.
N.Z. Shor,Minimization Methods for Non-Differentiable Functions, Springer, Berlin, 1985.
D.M. Scott, A dynamic programming approach to time-staged convex programs, Technical Report SOL 85-3, Systems Optimization Laboratory, Department of Operations Research, Stanford University, 1985.
R.M. Van Slyke and R.J-B Wets, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM Journal of Applied Mathematics 17, 1969, 638–663.
R.J-B Wets, Large scale linear programming techniques, inNumerical Techniques for Stochastic Optimization, Y. Ermoliev and R.J-B Wets, eds., Springer, Berlin, 1988.
R.J. Wittrock, Advances in a nested decomposition algorithm for solving staircase linear programs, Technical Report SOL 83-2, Systems Optimization Laboratory, Department of Operations Research, Stanford University, 1983.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Morton, D.P. An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling. Ann Oper Res 64, 211–235 (1996). https://doi.org/10.1007/BF02187647
Issue Date:
DOI: https://doi.org/10.1007/BF02187647