A simple heuristic for reducing the number of scenarios in two-stage stochastic programming

In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approximation strategy where we reduce the number of scenarios and obtain an approximation of the original multiscenario optimi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & chemical engineering Ročník 34; číslo 8; s. 1246 - 1255
Hlavní autori: Karuppiah, Ramkumar, Martín, Mariano, Grossmann, Ignacio E.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 01.08.2010
Predmet:
Approximation
Equivalence
Heuristic
Mathematical analysis
Mathematical models
Multiscenario model
Optimization
Programming
Scenario reduction
Stochastic approximation
Stochasticity
Strategy
Two-stage stochastic programming
Stochastic approximation
Multiscenario model
Scenario reduction
Two-stage stochastic programming
ISSN:0098-1354, 1873-4375
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approximation strategy where we reduce the number of scenarios and obtain an approximation of the original multiscenario optimization problem. In this strategy, a subset of the given set of scenarios is selected based on a proposed criterion, and probabilities are assigned to the occurrence of scenarios in the reduced set. The original stochastic programming model is converted into a deterministic equivalent using the reduced set of scenarios. A mixed-integer linear program (MILP) is proposed for the reduced scenario selection. We apply this practical heuristic strategy to four numerical examples and show that reformulating and solving the stochastic program with the reduced set of scenarios yields an objective value close to the optimum of the original multiscenario problem.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0098-1354
1873-4375
DOI:10.1016/j.compchemeng.2009.10.009