An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling

Annals of Operations Research

Volumn 64, Issue , 1996, Pages 211-235

  Morton, David P ^a  

^a The University of Texas at Austin   (United States)

Author keywords

Hydroelectric scheduling; Large scale systems; Stochastic programming

Indexed keywords

EID: 21344469142     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/BF02187647     Document Type: Article

References (20)

1. P.G. Abrahamson, A nested decomposition approach for solving staircase linear programs, Ph.D. Dissertation, Department of Operations Research, Stanford University, 1983.
2. 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.
3. J.R. Birge, Decomposition and partitioning methods for multistage stochastic linear programs, Operations Research 33, 1985, 989-1007.
4. 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.
5. H.A. Eiselt, G. Pederzoli and C.-L. Sandblom, Continuous Optimization Models, W. de Gruyter, Berlin/New York, 1987.
6. S. Garstka and D. Rutenberg, Computation in discrete stochastic programs with recourse, Operations Research 21, 1973, 112-122.
7. H.I. Gassmann, MSLiP: A computer code for the multistage stochastic linear programming problem, Mathematical Programming 47, 1990, 407-423.
8. G. Infanger, Planning under Uncertainty - Solving Large-Scale Stochastic Linear Programs, The Scientific Press Serres, Boyd and Fraser, 1993.
9. J.M. Jacobs, Advanced basis insertion for repeated optimization of networks with side constraints, Pacific Gas & Electric Company, 1992.
10. 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.
11. J.L. Kennington and R. V. Helgason, Algorithms for Network Programming, Wiley, New York, 1980.
12. R.T. Rockafellar and R.J-B Wets, Scenarios and policy aggregation in optimization under uncertainty, Mathematics of Operations Research 16, 1991, 119-147.
13. A. Ruszczyński, On augmented Lagrangian decomposition methods for multistage stochastic programs, Working Paper WP-94-05, NASA, Laxenburg, 1994.
14. A. Ruszczyński, Regularized decomposition of stochastic programs: Algorithmic techniques and numerical results, Working Paper WP-93-21, IIASA, Laxenburg, 1993.
15. A. Ruszczyński, A regularized decomposition method for minimizing a sum of polyhedral functions, Mathematical Programming 35, 1986, 309-333.
16. N.Z. Shor, Minimization Methods for Non-Differentiable Functions, Springer, Berlin, 1985.
17. 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.
18. 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.
19. R.J-B Wets, Large scale linear programming techniques, in Numerical Techniques for Stochastic Optimization, Y. Ermoliev and R.J-B Wets, eds., Springer, Berlin, 1988.
20. 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.