Skip to main content

Multistage Stochastic Programming Problems; Stability and Approximation

  • Conference paper

Part of the Operations Research Proceedings book series (ORP,volume 2006)

Abstract

A multistage stochastic programming problem can be introduced as a finite system of parametric one-stage optimization problems with an inner type of dependence and mathematical (mostly conditional) expectation in objective functions of the individual problems (for more details see e.g. [1], [3], [8]). The constraints sets can depend on the “underlying” probability measure.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dupacová J (1995) Multistage stochastic programs: the state-of-the-art and selected bibliography. Kybernetika 31: 151–174.

    Google Scholar 

  2. Kanková V (1998) A note on multistage stochastic programming. In: Proceedings of 11th joint Czech-Germany-Slovak Conf.: Mathematical Methods in Economy and Industry. University of Technology, Liberec (Czech Republic) 1998, pp 45–52.

    Google Scholar 

  3. Kanková V (2002) A Remark on the analysis of multistage stochastic programs, Markov dependence. Z angew Math Mech 82:781–793.

    CrossRef  Google Scholar 

  4. Kanková V, Smíd M (2004) On approximation in multistage stochastic programs: Markov dependence. Kybernetika 40:625–638.

    Google Scholar 

  5. Kanková V (2006) Decomposition in multistage stochastic programming programs with individual probability constraints. In: Operations Research Proceedings 2005. Springer, Berlin: 793–798.

    CrossRef  Google Scholar 

  6. Kanková V, Houda M (2006) Dependent samples in empirical estimation of stochastic programming problems. Austrian Journal of Statistics 35:271–279.

    Google Scholar 

  7. Kanková V, Houda M (2006) Empirical estimates in stochastic programming. In: Proceedings of Prague Stochastics 2006 (M. Husková and M. Janzra, eds.). MATFYZPRESS, Prague: 426–436.

    Google Scholar 

  8. Kuhn D (2005) Generalized bound for convex multistage stochastic programs. Lectures Notes in Economics and Mathematical Systems. Springer, Berlin.

    Google Scholar 

  9. Mänz A, Vogel S (2006) On stability of multistage stochastic decision problem. In: Reecent Advances in Optimization. Lecture Notes in Economics and Mathematical Systems (A. Seeger, ed.). Springer, Berlin.

    Google Scholar 

  10. Pflug GCh (2001) Scenario tree generation for multiperiod financial optimization by optimal discretization. Math Program ser B 89: 251–271.

    CrossRef  Google Scholar 

  11. Rachev ST(1991) Probability metrics and the stability of stochastic models. Wiley, Chichester.

    Google Scholar 

  12. Salinetti G (1983) Approximations for chance constrained programming problems. Stochastics 10:157–179.

    Google Scholar 

  13. Smíd M (2005) On Approximation of stochastic programming problems. Doctoral Thesis, Charles University, Prague.

    Google Scholar 

  14. Shorack GR, Wellner JA (1986) Empirical processes with applications to statistics. Wiley New York.

    Google Scholar 

  15. Valander SS (1973) Calculation of the Wasserstein distance between probability distributions on the line (in Russian). Theor Probab Appl 18: 784–786.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kanková, V. (2007). Multistage Stochastic Programming Problems; Stability and Approximation. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_94

Download citation

Publish with us

Policies and ethics