Advertisement

On the Numerical Solution of Stochastic Optimization Problems

  • J. Mayer
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 199)

Abstract

We introduce the stochastic linear programming (SLP) model classes, which will be considered in this paper, on the basis of a small-scale linear programming problem. The solutions for the various problem formulations are discussed in a comparative fashion. We point out the need for model and solution analysis. Subsequently, we outline the basic ideas of selected major algorithms for two classes of SLP problems: two-stage recourse problems and problems with chance constraints. Finally, we illustrate the computational behavior of two algorithms for large-scale SLP problems.

keywords

stochastic linear programming numerical methods 

References

  1. [1]
    J.F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numer. Math., 4:238–252, 1962.MATHMathSciNetCrossRefGoogle Scholar
  2. [2]
    J.R. Birge and F. Louveaux. Introduction to Stochastic Programming. Springer-Verlag, Berlin/Heidelberg, 1997.MATHGoogle Scholar
  3. [3]
    J. Elzinga and T.G. Moore. A central cutting plane method for the convex programming problem. Math. Progr., 8:134–145, 1975.MathSciNetCrossRefMATHGoogle Scholar
  4. [4]
    K. Frauendorfer and P. Kall. A solution method for SLP recourse problems with arbitrary multivariate distributions — the independent case. Probl. Contr. Inf. Theory, 17:177–205, 1988.MathSciNetMATHGoogle Scholar
  5. [5]
    K. Frauendorfer. Stochastic Two-Stage Programming. Springer-Verlag, Berlin, 1992.MATHGoogle Scholar
  6. [6]
    J.L. Higle and S. Sen. Stochastic decomposition: An algorithm for two stage linear programs with recourse. Math. Oper. Res., 16:650–669, 1991.MathSciNetCrossRefMATHGoogle Scholar
  7. [7]
    J.L. Higle and S. Sen. Stochastic decomposition. A statistical method for large scale stochastic linear programming. Kluwer Academic Publ., 1996.Google Scholar
  8. [8]
    P. Kall. Approximations to stochastic programs with complete fixed recourse. Numer. Math., 22:333–339, 1974.MATHMathSciNetCrossRefGoogle Scholar
  9. [9]
    P. Kall and D. Stoyan. Solving stochastic programming problems with recourse including error bounds. Math. Operationsforsch. Statist., Ser. Opt., 13:431–447, 1982.MathSciNetMATHGoogle Scholar
  10. [10]
    P. Kall and J. Mayer. SLP-IOR: An interactive model management system for stochastic linear programs. Math. Prog. B, 75:221–240, 1996.MathSciNetCrossRefGoogle Scholar
  11. [11]
    P. Kall and J. Mayer. Stochastic linear programming. Models, theory and computation. Springer-Verlag, 2005.Google Scholar
  12. [12]
    P. Kall and J. Mayer. Building and solving stochastic linear programming models with SLP-IOR. In S.W. Wallace and W.T. Ziemba, editors, Applications of Stochastic Programming, pages 77–90. MPS SIAM, SIAM, Philadelphia, 2005.Google Scholar
  13. [13]
    P. Kall and J. Mayer. Some insights into the solution algorithms for SLP problems. Ann. Oper. Res., 2005. To appear.Google Scholar
  14. [14]
    P. Kall and S.W. Wallace. Stochastic programming. John Wiley & Sons, Chichester, 1994.MATHGoogle Scholar
  15. [15]
    W.K. Klein Haneveld and M.H. van der Vlerk. Integrated chance constraints: reduced forms and an algorithm. Comp. Management Sci., 2005. To appear.Google Scholar
  16. [16]
    A. Künzi-Bay and J. Mayer. Computational aspects of minimizing conditional value-at-risk. Comp. Management Sci., 2005. To appear.Google Scholar
  17. [17]
    W-K. Mak, D.P. Morton, and R.K. Wood. Monte Carlo bounding techniques for deter-mining solution quality in stochastic programs. Oper. Res. Lett., 24:47–56, 1999.MathSciNetCrossRefMATHGoogle Scholar
  18. [18]
    K. Marti. Stochastic optimization. Springer-Verlag, 2005.Google Scholar
  19. [19]
    J. Mayer. Stochastic Linear Programming Algorithms: A Comparison Based on a Model Management System. Gordon and Breach Science Publishers, 1998.Google Scholar
  20. [20]
    J. Mayer. On the numerical solution of jointly chance constrained problems. In S. Uryasev, editor, Probabilistic constrained optimization: Methodology and applications, pages 220–233. Kluwer Academic Publ., 2000.Google Scholar
  21. [21]
    Cs. Mészáros. The augmented system variant of IPMs in two-stage stochastic linear programming computation. Eur. J. Oper. Res., 101:317–327, 1997.MATHCrossRefGoogle Scholar
  22. [22]
    A. Prékopa. Stochastic programming. Kluwer Academic Publ., 1995.Google Scholar
  23. [23]
    A. Ruszczyński. A regularized decomposition method for minimizing a sum of polyhedral functions. Math. Progr., 35:309–333, 1986.CrossRefMATHGoogle Scholar
  24. [24]
    A. Shapiro and T. Homem-de-Mello. On the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs. SIAM J. Opt., 11:70–86, 2000.MathSciNetCrossRefMATHGoogle Scholar
  25. [25]
    R. Van Slyke and R. J-B. Wets. L-shaped linear programs with applications to optimal control and stochastic linear programs. SIAM J. Appl. Math., 17:638–663, 1969.MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • J. Mayer
    • 1
  1. 1.Institute for Operations ResearchUniversity of ZurichZurichSwitzerland

Personalised recommendations