Skip to main content
  • 654 Accesses

Zusammenfassung

As we have discussed in the previous chapters, many stochastic optimization problems do not allow for an analytic solution, and, hence, one has to resort to numerical approaches. However, numerical approaches usually require the underlying probability measures to have only a finite support. While such finite measures can be obtained, e.g., by sampling or from historical data, the number of atoms (or, scenarios) has to be in general sufficiently small to maintain the numerical tractability. Approximating a (finite) probability measure by a measure with a smaller number of atoms is denoted as scenario reduction in the literature.

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.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Vieweg+Teubner | GWV Fachverlage GmbH

About this chapter

Cite this chapter

Küchler, C. (2009). Scenario Reduction with Respect to Discrepancy Distances. In: Stability, Approximation, and Decomposition in Two- and Multistage Stochastic Programming. Vieweg+Teubner. https://doi.org/10.1007/978-3-8348-9399-4_4

Download citation

Publish with us

Policies and ethics