Abstract
We consider multiple simple recourse (MSR) models, both continuous and integer versions, which generalize the corresponding simple recourse (SR) models by allowing for a refined penalty cost structure for individual shortages and surpluses. It will be shown that (convex approximations of) such MSR models can be represented as explicitly specified continuous SR models, and thus can be solved efficiently by existing algorithms.
Similar content being viewed by others
References
Birge JR, Louveaux FV (1997) Introduction to stochastic programming. Springer, Berlin Heidelberg New York
Drijver SJ, Klein Haneveld WK, van der Vlerk MH (2003) Asset liability management modeling using multistage mixed-integer stochastic programming. In: Scherer B. (ed). Asset and liability management tools: a handbook for best practice, chap 16. Risk Books, London, pp. 309–324
Dupačová J, Gaivoronski A, Kos Z, Szántai T (1991) Stochastic programming in water management: a case study and a comparison of solution techniques. Eur J Oper Res 52:28–44
Kall P, Mayer J (1996) SLP-IOR: an interactive model management system for stochastic linear programs. Math Program 75(2):221–240
Kall P, Stoyan D (1982) Solving stochastic programming problems with recourse including error bounds. Math Operationsforsch Statist Ser Optim 13(3):431–447
Kall P, Wallace SW (1994) Stochastic programming. Wiley, Chichester. Also available as, PDF file, e.g. via http://stoprog.org
Klein Haneveld WK (1986) Duality in stochastic linear and dynamic programming. Lecture notes in economics and mathematical systems, vol 274. Springer, Berlin Heidelberg New York
Klein Haneveld WK, Stougie L, van der Vlerk MH (1995) On the convex hull of the simple integer recourse objective function. Ann Oper Res 56:209–224
Klein Haneveld WK, Stougie L, van der Vlerk MH (1996) An algorithm for the construction of convex hulls in simple integer recourse programming. Ann Oper Res 64:67–81
Klein Haneveld WK, Stougie L, van der Vlerk MH (1997) Convex approximations for simple integer recourse models by perturbing the underlying distribution. Research Report 97A19, SOM, University of Groningen, http://som.rug.nl
Klein Haneveld WK, Stougie L, van der Vlerk MH (1997) Convex simple integer recourse problems. Research Report 97A10, SOM, University of Groningen, http://som.rug.nl
Klein Haneveld WK, van der Vlerk MH (2001) Optimizing electricity distribution using two-stage integer recourse models. In: Uryasev S, Pardalos PM. (ed). Stochastic optimization: algorithms and applications. Kluwer, Dordrecht, pp. 137–154
Louveaux FV, van der Vlerk MH (1993) Stochastic programming with simple integer recourse. Math Program 61:301–325
Prékopa A (1995) Stochastic programming. Kluwer, Dordrecht
Rockafellar RT, Wets RJ-B (1986) A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming. Math Program Study Ser 28:63–93, Stochastic programming 84. II
Ruszczynski A, Shapiro A. (eds) Stochastic programming. Handbooks in operations research and management science, vol 10. North-Holland, Amsterdam
Stochastic Programming Community Home Page sponsored by COSP., http://stoprog.org
van der Vlerk MH. (1995) Stochastic programming with integer recourse. PhD Thesis. University of Groningen, The Netherlands
van der Vlerk MH (2004) Convex approximations for complete integer recourse models. Math Program 99(2):297–310
Wets RJ-B (1966) Programming under uncertainty: The complete problem. Z Wahrscheinlichkeitstheorie und verw. Gebiete 4:316–339
Wets RJ-B (1984) Solving stochastic programs with simple recourse. Stochastics 10:219–242
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences.
Rights and permissions
About this article
Cite this article
Vlerk, M.H.v.d. On multiple simple recourse models. Math Meth Oper Res 62, 225–242 (2005). https://doi.org/10.1007/s00186-005-0021-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-005-0021-9