[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Solving two-stage stochastic programming problems with level decomposition

  • Original Paper
  • Published:
Computational Management Science Aims and scope Submit manuscript

Abstract

We propose a new variant of the two-stage recourse model. It can be used e.g., in managing resources in whose supply random interruptions may occur. Oil and natural gas are examples for such resources. Constraints in the resulting stochastic programming problems can be regarded as generalizations of integrated chance constraints. For the solution of such problems, we propose a new decomposition method that integrates a bundle-type convex programming method with the classic distribution approximation schemes. Feasibility and optimality issues are taken into consideration simultaneously, since we use a convex programming method suited for constrained optimization. This approach can also be applied to traditional two-stage problems whose recourse functions can be extended to the whole space in a computationally efficient way. Network recourse problems are an example for such problems. We report encouraging test results with the new method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Andersen ED, Andersen KD (2000) The MOSEK interior-point optimizer for linear programming: an implementation of the homogeneous algorithm. In: Frenk H, Roos K, Terlaky T, Zhang S, (eds) High performance optimization. Kluwer, Dordrecht, pp 197–232

    Google Scholar 

  • Beale EML (1955) On minimizing a convex function subject to linear inequalities. J R Stat Soc Ser B 17:173–184

    Google Scholar 

  • Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238–252 republished in Comput Manage Sci 2:3–19 (2005)

    Google Scholar 

  • Birge JR, Louveaux FV (1997) Introduction to Stochastic Programming. Springer, Berlin Heidelberg New York

    Google Scholar 

  • Birge JR, Wets RJ-B (1986) Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse. In: Prékopa A, Wets RJ-B (eds) Stochastic Programming 84, Vol 1. Mathematical Programming Study 27:54–102

  • Björck Å (1996) Numerical methods for least squares problems. Society for Industrial and Applied Mathematics, Philadelphia

  • Dantzig GB (1955) Linear programming under uncertainty. Manage Sci 1:197–206

    Google Scholar 

  • Dantzig GB, Madansky A (1961) On the solution of two-stage linear programs under uncertainty. In: Proceedings of the 4th Berkeley symposium on mathematical statistics and probability, vol 1: pp 165–176. University of California Press, Berkeley

  • Dantzig GB, Wolfe P (1960) The decomposition principle for linear programs. Oper Res 8:101–111

    Google Scholar 

  • Fábián CI (2000) Csendes T, Rapcsák T (eds) Bundle-type methods for inexact data. Central Eur J Oper Res 8 (special issue); 35–55

  • Fábián CI (2005) Decomposing CVaR minimization in two–stage stochastic models. Stochastic Programming E-Print Series 20

  • Fábián CI (2006) Handling CVaR objectives and constraints in two-stage stochastic models. RUTCOR Research Report, vol 5

  • Frauendorfer K (1988) Solving SLP recourse problems with arbitrary multivariate distributions – the dependent case. Math Oper Res 13:377–394

    Article  Google Scholar 

  • Frauendorfer K, Kall P (1988) A solution method for SLP recourse problems with arbitrary distributions – The independent case. Probl Control Inf Theory 17:177–205

    Google Scholar 

  • Gassmann HI, Wallace SW (1996) Solving linear programs with multiple right–hand sides: pricing and ordering schemes. Ann Oper Res 64:237–259

    Article  Google Scholar 

  • Gondzio J, Grothey A (2003) Reoptimization with the primal-dual interior point method. SIAM J Optim 13:842–864

    Article  Google Scholar 

  • Kall P (1980) Solving complete fixed recourse problems by successive discretization. In: Kall P, Prékopa A (eds) Recent Results in Stochastic Programming, Lecture Notes in Economics and Math. Systems 170. Springer, Berlin, Heidelberg New York, pp 135–138

    Google Scholar 

  • Kall P, Mayer J (2005) Stochastic Linear Programming: Models, Theory, and Computation. International series in operations research and management science. Springer, Berlin, Heidelberg New York

    Google Scholar 

  • Kall P, Stoyan D (1982) Solving stochastic programming problems with recourse including error bounds. Math Opernforsch Stat Ser Optim 13:431–447

    Google Scholar 

  • Kall P, Wallace SW (1994) Stochastic programming. Wiley, Chichester

    Google Scholar 

  • Kennington JL, Helgason RV (1980) Algorithms for Network Programming. Wiley, New York

    Google Scholar 

  • Klafszky E, Terlaky T (1992) On the ellipsoid method. Radov Mat 8:269–280

    Google Scholar 

  • 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

    Google Scholar 

  • Künzi-Bay A, Mayer J (2006) Computational aspects of minimizing conditional value-at-risk. Comput Manage Sci 3:3–27

    Article  Google Scholar 

  • Lemaréchal C (1982) Basic theory in nondifferentiable optimization. Research Report No. 181, Institut National de Recherche en Informatique at en Automatique, Domaine de Voluceau, Rocquencourt, France

  • Lemaréchal C, Nemirovskii A, Nesterov Yu (1995) New variants of bundle methods. Math Program 69:111–147

    Article  Google Scholar 

  • Linderoth JT, Shapiro A, Wright SJ (2002) The empirical behavior of sampling methods for stochastic programming. Optimization Technical Report 02-01. Computer Science Department, University of Wisconsin-Madison

  • Mak W-K, Morton D, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper Res Lett 24:47–56

    Article  Google Scholar 

  • Maros I (2003a) A generalized dual phase-2 simplex algorithm. Eur J Oper Res 149:1–16

    Article  Google Scholar 

  • Maros I (2003b) Computational techniques of the simplex method. Kluwer, Boston

    Google Scholar 

  • Mayer J (1998) Stochastic linear programming algorithms. Gordon and Breach, Amsterdam

    Google Scholar 

  • Mulvey JM, Ruszczyński A (1995) A new scenario decomposition method for large scale stochastic optimization. Oper Res 43:477–490

    Google Scholar 

  • Norkin VI, Pflug GCh, Ruszczyński A (1998) A branch and bound method for stochastic global optimization. Math program 83:425–450

    Google Scholar 

  • Prékopa A (1971) Logarithmic concave measures with applications to stochastic programming. Acta Sci Math (Szeged) 32:301–316

    Google Scholar 

  • Prékopa A (1973) Contributions to the theory of stochastic programming. Math Program 4:202–221

    Article  Google Scholar 

  • Prékopa A (1995). Stochastic Programming. Kluwer, Dordrecht

    Google Scholar 

  • Prékopa A (2003) Probabilistic programming. In: Ruszczyński A, Shapiro A (eds) Stochastic Programming, Handbooks in Operations Research and Management Science vol 10, pp 267–351 Elsevier, Amsterdam

  • Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J Risk 2:21–41

    Google Scholar 

  • Roos C, Terlaky T, Vial J-Ph (1997) Theory and Algorithms for Linear optimization. Wiley, Chichester

    Google Scholar 

  • Ruszczyński A (1986) A regularized decomposition method for minimizing the sum of polyhedral functions. Math Program 35:309–333

    Article  Google Scholar 

  • Ruszczyński A (2003) Decomposition methods. In: Ruszczyński A, Shapiro A (eds) Stochastic Programming. Handbooks in Operations Research and Management Science, vol 10, pp 141-211 Elsevier, Amsterdam

  • Ruszczyński A, Shapiro A (2003) Stochastic Programming Models. In: Ruszczyński A, Shapiro A (eds)Stochastic Programming. Handbooks in Operations Research and Management Science, vol 10, pp 1-64 Elsevier, Amsterdam

  • Ruszczyński A, Świetanowski A (1997) Accelerating the regularized decomposition method for two-stage stochastic linear problems. Eur J Oper Res 101:328–342

    Article  Google Scholar 

  • Schrijver A (1986) Theory of linear and integer programming. Wiley, Chichester

    Google Scholar 

  • Shapiro A (2003) Monte Carlo sampling methods. In: Ruszczyński A, Shapiro A (eds) Stochastic Programming, Handbooks in Operations Research and Management Science, vol 10 pp 353–425 Elsevier, Amsterdam

  • Shapiro A, Homem-de-Mello T (1998) A simulation-based approach to two-stage stochastic programming with recourse. Math Program 81:301–325

    Google Scholar 

  • Shapiro A, Homem-de-Mello T (2000) On the rate of convergence of Monte Carlo approximations of stochastic programs. SIAM J Optim 11:70–86

    Article  Google Scholar 

  • Szántai T (1988) A computer code for the solution of probabilistic-constrained stochastic programming problems. In: Ermoliev Yu, Wets RJ-B (eds) Numerical Techniques for Stochastic Optimization. Springer, Berlin Heidelberg New York

    Google Scholar 

  • Van Slyke R, Wets RJ-B (1969) L-Shaped linear programs with applications to optimal control and stochastic programming. SIAM J Appl Math 17:638–663

    Article  Google Scholar 

  • Wets RJ-B (1974) Stochastic programs with fixed recourse: the equivalent deterministic program. SIAM Review 16:309–339

    Article  Google Scholar 

  • Zakeri G, Philpott AB, Ryan DM (2000) Inexact cuts in Benders decomposition. SIAM J Optim 10:643–657

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, Loránd Eötvös University of Budapest, P.O. Box 120, Budapest, 1518, Hungary

    Csaba I. Fábián

  2. Doctoral School in Applied Mathematics, Loránd Eötvös University of Budapest, Budapest, Hungary

    Zoltán Szőke

Authors
  1. Csaba I. Fábián
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zoltán Szőke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Csaba I. Fábián.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fábián, C.I., Szőke, Z. Solving two-stage stochastic programming problems with level decomposition. CMS 4, 313–353 (2007). https://doi.org/10.1007/s10287-006-0026-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10287-006-0026-8

Keywords

Mathematics Subject Classification

Search

Navigation