Skip to main content

Multistage Stochastic Programming; Stability, Approximation and Markov Dependence

  • Conference paper
Operations Research Proceedings 1999

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

Abstract

A general (M+l)-stage (M ≥ 1) stochastic programming problem can be considered either as an optimization problem with respect to some mathematical abstract space (say L p , p ≥ 1) or recursively as the problem (see e.g. [1]).

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 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 132.00
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. J. Dupačová: Multistage stochastic programs: the state-of-the-art and selected bibliography. Kybernetika 31 (1995), 151–174.

    Google Scholar 

  2. V. Kaňková: On Distribution Sensitivity in Stochastic Programming. Research Report UTIA AS CR no. 1826, Prague 1994.

    Google Scholar 

  3. V. Kaňková: A note on the relationship between distribution function estimation and estimation in stochastic programming. In: Trans. 12th Prague Conference, Prague 1994, 122–125.

    Google Scholar 

  4. V. Kaňková: A note on multistage stochastic programming. In: Mathematical Methods in Economy and Industry (11th Joint Czech-Germany-Slovak Conference), 1998 (Czech Republic), 45–52.

    Google Scholar 

  5. A. Prékopa: Stochastic Programming, Akadémiai Kiadó and Kluwer Publisher, 1995.

    Google Scholar 

  6. W. Römisch and A. Wakolbinger: Obtaining convergence rate for approximations in stochastic programming. In: Parametric Optimization and Related Topics (J. Guddat, ed.). Akademie Verlag, Berlin, 1987, 327–343.

    Google Scholar 

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

    Article  Google Scholar 

  8. R. Schulz: Rates of convergence in stochastic programs with complete integer recourse. SIAM J. Optimization 6 (1996) 1138–1152.

    Article  Google Scholar 

  9. S. Vogel: On stability in multiobjective programming — a stochastic approach. Math. Progr. 56 (1992) 91–119.

    Article  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 paper

Cite this paper

Kaňková, V. (2000). Multistage Stochastic Programming; Stability, Approximation and Markov Dependence. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds) Operations Research Proceedings 1999. Operations Research Proceedings 1999, vol 1999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58300-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58300-1_23

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-58300-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics