Abstract
In this paper, we propose an approximation scheme to solve large stochastic mixed-integer programming (SMIP) problems with fixed recourse. We refer to this as the Scenari o Updating Method. The algorithm is based on solving instances of the problem, which cont ain only a subset of the scenarios in the scenario tree. At each iteration, th e subset of scenarios is updated by adding only those scenarios which suggest a significant potential for change in the objective function value. The algorithm is terminated when the potential for change is insignificant.Different selection and updating rules are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Birge J.R., Louveaux F. (1997) Introduction to Stochastic Programming. Springer, Berlin Heidelberg.
Caree C.C., Schultz R. (1999) Dual Decomposition in Stochastic Integer Programming. Operations Research Letters 24 37–45.
Dupacova J. (1995) Postoptimality for Multistage stochastic linear programs. Annals of Operations Research 56, pp. 65–78.
Dupacova J., Consigli G. and Wallace S.W. (2000) Scenarios for Multistage Stochastic Programming. Annals of Operations Research 100 25–53.
Hoyland K., Wallace S.W. (2001) Generating scenario trees for multistage decision problems. Management Science 47 295–307.
Klaassen P. (1998) Financial Asset-Pricing Theory and Stochastic Programming Models for Asset/Liability Management: A Synthesis. Management Science 44 31–48.
Kouwenberg R.R.P. (2001) Scenario generation and stochastic programming models for asset liability management. European Journal of Operational Research 134 51–64.
Lekketangen A., Woodruff D.L. (1996) Progressive Hedging and Tabu Search Applied to Mixed Integer (0,1) Multi-stage Stochastic Programming. Journal of Heuristics 2 111–128.
Lulli G., Sen S. (2002) A Branch-and-Price Algorithm for Multi-stage Stochastic Integer Programming with Applicat ion to Stochastic Batch-Sizing Problems. Submitted for pubblication.
Pflug G.Ch. (2001) Scenario tree generation for multiperiod financial optimization by optimal discretization. Mathematical Programming 89 251–271.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lulli, G., Sen, S. (2003). Scenario Updating Method for Stochastic Mixed-integer Programming Problems. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-55537-4_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00387-8
Online ISBN: 978-3-642-55537-4
eBook Packages: Springer Book Archive