Abstract
Many optimization problems can be expressed naturally in a recursive manner. Problems with a dynamic structure are commonly expressed in this way especially when they are to be solved by dynamic programming. Many stochastic linear programming problems have an underlying Markov structure, and for these a recursive definition is natural. Real-world examples of such problems are often so large that it is not practical to solve them without a modeling language. No existing algebraic modeling language provides a natural way of specifying a model using a dynamic programming recurrence. This paper describes the advantages of recursive model definition for stochastic linear programming problems, and presents the language constructs necessary to implement this within an algebraic modeling language.
Similar content being viewed by others
References
T.W. Archibald, C.S. Buchanan, K.I.M. McKinnon and L.C. Thomas, Nested benders decomposition and dynamic programming for reservoir optimization, Journal of the Operational Research Society (1999) 468-479.
J.R. Birge, M.A.H. Dempster, H.I. Gassmann, E.A. Gunn, A.J. King and S.W. Wallace, A standard input format for multiperiod stochastic linear programs, COAL Neswletter 17 (1987) 1–19.
C.S. Buchanan, Benders decomposition for reservoir management, Ph.D. thesis, University of Edinburgh (1999).
R. Fourer, Stochastic programming extensions, http://www.ampl.com/ampl/NEW/FUTURE/stoch. html (1996).
R. Fourer and D.M. Gay, Proposals for stochastic programming in the AMPL modeling language, http://www.iems.nwu.edu/ 4er/SLIDES/#lsn9708 (1997).
H.I. Gassmann and A.M. Ireland, Scenario formulation in an algebraic modelling language, Annals of Operations Research 59 (1995) 45–75.
H.I. Gassmann and A.M. Ireland, On the formulation of stochastic linear programs using algebraic modelling languages, Annals of Operations Research 64 (1996) 83–112.
H.I. Gassmann and E. Schweitzer, Proposed extensions to the SMPS input format for stochastic linear programs, Working Paper WP-96-1, School of Business Administration, Dalhousie University, Halifax, Canada (1996).
G. Infanger, Planning Under Uncertainty: Solving Large-Scale Stochastic Linear Programs (Boyd & Fraser, 1994).
Process Systems Enterprise Limited, Web site for gPROMS, http://www.psenterprise.com/.
G.K. Skondras, Modelling languages in mathematical programming, Master's thesis, Department of Mathematics & Statistics, University of Edinburgh (1998).
The ASCEND group, The ASCEND project web site, http://www.cs.cmu.edu/~ascend/.
R.J.-B. Wets, Stochastic programs with fixed recourse: The equivalent deterministic program, SIAM Review 16(3) (1974) 309–339.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Buchanan, C., McKinnon, K. & Skondras, G. The Recursive Definition of Stochastic Linear Programming Problems within an Algebraic Modeling Language. Annals of Operations Research 104, 15–32 (2001). https://doi.org/10.1023/A:1013126632649
Issue Date:
DOI: https://doi.org/10.1023/A:1013126632649