2007
DOI: 10.1007/s10589-007-9123-z
|View full text |Cite
|
Sign up to set email alerts
|

Scenario reduction in stochastic programming with respect to discrepancy distances

Abstract: Stochastic programming, Chance constraints, Two-stage, Mixed-integer, Scenario reduction, Discrepancy, Kolmogorov metric,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
6
2
1

Relationship

3
6

Authors

Journals

citations
Cited by 59 publications
(39 citation statements)
references
References 17 publications
0
39
0
Order By: Relevance
“…, m k , respectively. Then, due to its special form, every polyhedron B in B poly(W) can be written as Analogous to the concept of supporting cells in [9], we will show that it suffices to consider the following supporting polyhedra. Loosely speaking, a polyhedron B ∈ B poly(W) is called supporting if each of its facets contains an element of ξ 1 , .…”
Section: René Henrion Christian Küchler and Werner Römischmentioning
confidence: 96%
See 1 more Smart Citation
“…, m k , respectively. Then, due to its special form, every polyhedron B in B poly(W) can be written as Analogous to the concept of supporting cells in [9], we will show that it suffices to consider the following supporting polyhedra. Loosely speaking, a polyhedron B ∈ B poly(W) is called supporting if each of its facets contains an element of ξ 1 , .…”
Section: René Henrion Christian Küchler and Werner Römischmentioning
confidence: 96%
“…In Section 2 we state the problem of optimal scenario reduction with respect to a discrepancy distance α B and decompose it into a combinatorial and a linear optimization problem. Extending our earlier work in [9], we discuss in Section 3 how the coefficients of the linear program may be computed in case of the polyhedral discrepancy α B poly(W) . Algorithms for determining the optimally reduced probability distribution (with respect to α B poly(W) ) are developed in Sections 4 and 5.…”
Section: René Henrion Christian Küchler and Werner Römischmentioning
confidence: 99%
“…While both [3] and [4] derived scenario reduction method according to the upper bound of Fortet-Mourier metrics instead of the metrics themselves, [28] refined a scenario reduction method for two-stage stochastic programs rigorously based on Fortet-Mourier metrics. These methods were further extended to chance constrained and mixed-integer two-stage stochastic programs in [29], which are stated with respected to cell discrepancy (or the Kolmogorov metric), while [30] extended the work in [29] with a certain polyhedral discrepancy. Further extensions to multi-stage stochastic programs were made in [31][32][33][34].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Originally, the concept of scenario reduction was developed in [DGKR03,HR03]. More recently, it has been improved for two-stage models in [HR07] and extended to mixed-integer and chance constrained models in [HKR08,HKR09] as well as to multi-stage models in [HR09b]. The concept does not impose special conditions on the underlying probability distribution except the existence of certain moments.…”
Section: Optimal Scenario Reductionmentioning
confidence: 99%