Abstract
A major issue in any application of multistage stochastic programming is the representation of the underlying random data process. We discuss the case when enough data paths can be generated according to an accepted parametric or nonparametric stochastic model. No assumptions on convexity with respect to the random parameters are required. We emphasize the notion of representative scenarios (or a representative scenario tree) relative to the problem being modeled.
Original language | British English |
---|---|
Pages (from-to) | 25-53 |
Number of pages | 29 |
Journal | Annals of Operations Research |
Volume | 100 |
Issue number | 1-4 |
DOIs | |
State | Published - 2000 |
Keywords
- Clustering
- Importance sampling
- Inference and bounds
- Matching moments
- Problem oriented requirements
- Scenarios and scenario trees