Skip to main content

An Ergodic Theorem for Stochastic Programming Problems

  • Chapter
Book cover Optimization

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 481))

Abstract

To justify the use of sampling to solve stochastic programming problems one usually relies on a law of large numbers for random lsc (lower semicontinuous) functions when the samples come from independent, identical experiments. If the samples come from a stationary process, one can appeal to the ergodic theorem proved here. The proof relies on the ‘scalarization’ of random lsc functions.

Research supported in part by a grant of the National Science Foundation

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wets, R. J-B (1989) Stochastic Programming. Handbook for Operations Research and Management sciences # 1, Elsevier Science, North Holland

    Google Scholar 

  2. Birge, J.R., Louveaux, F. (1997) Introduction to Stochastic Programming. Springer, Heidelberg

    Google Scholar 

  3. Korf, L.A., Wets, R. J-B (1999) Ergodic limit laws for stochastic optimization problems. Manuscript, University of California, Davis

    Google Scholar 

  4. King, A.J., Wets, R. J-B (1990) Epi-consistency of convex stochastic programs. Stochastics and Stochastics Reports 34 83–92

    Google Scholar 

  5. Attouch, H., Wets, R. J-B (1990) Epigraphical processes: laws of large numbers for random lsc functions. Séminaire d’Analyse Convexe, Montpellier

    Google Scholar 

  6. Artstein, Z., Wets, R. J-B (1995) Consistency of minimizers and the SLLN for stochastic programs. J. of Convex Analysis 2 1–17

    Google Scholar 

  7. Hess, C. (1991) Epi-convergence of sequences of normal integrands and strong consistency of the maximum likelihood estimator. Cahiers no. 9121, Cérémade, Paris

    Google Scholar 

  8. Castaing, C., Ezzaki, F. (1995) SLLN for convex random sets and random lower semicontinuous integrands. Manuscript, Université de Montpellier

    Google Scholar 

  9. Attouch, H. (1984) Variational Convergence for Functions and Operators. Applicable Mathematics Series, Pitman

    Google Scholar 

  10. Aubin, J.-P, Frankowska, H. (1990) Set-Valued Analysis. Birkhäuser, Basel

    Google Scholar 

  11. Rockafellar, R.T., Wets, R. J-B (1997) Variational Analysis. Grundlehren der mathematischen Wissenschaften 317, Springer-Verlag, Heidelberg

    Google Scholar 

  12. King, A.J., Rockafellar R.T., Somlyody, L., Wets, R. J-B (1988) Lake eutrophication management: the Lake Balaton project. In: Ermoliev Y., Wets R. (Eds.) Numerical Techniques for Stochastic Optimization, Springer-Verlag, Heidelberg, 435–444

    Google Scholar 

  13. Salinger, D. (1997) A Splitting Algorithm for Multistage Stochastic Programming with Application to Hydropower Scheduling. Ph. D. Thesis, University of Washington, Seattle

    Google Scholar 

  14. Kall, P., Wallace, S. (1994) Stochastic Programming. J. Wiley&Sons, New York

    Google Scholar 

  15. Kibzun, A.I., Kan, Y.S. (1996) Stochastic Programming Problems with Probability and Quantile Functions. J. Wiley&Sons, New York

    Google Scholar 

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

    Google Scholar 

  17. Wets, R. J-B (1998) Stochastic programs with chance constraints: generalized convexity and approximation issues. In: Crouzeix J.-P., Martinez-Legaz J.E., Volle M. (Eds.) Generalized Convexity, Generalized Monotonicity: Recent Results. Kluwer, Dordrecht, 61–74

    Google Scholar 

  18. Korf, L.A., Wets, R. J-B (1999) Random lsc functions: scalarization. Manuscript, University of California, Davis

    Google Scholar 

  19. Durrett, R. (1991) Probability: Theory and Examples, Wadsworth and Brooks

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Korf, L.A., Wets, R.JB. (2000). An Ergodic Theorem for Stochastic Programming Problems. In: Nguyen, V.H., Strodiot, JJ., Tossings, P. (eds) Optimization. Lecture Notes in Economics and Mathematical Systems, vol 481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57014-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-57014-8_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66905-0

  • Online ISBN: 978-3-642-57014-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics