Aggregation and discretization in multistage stochastic programming

Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to ensure computational tractability, continuous-state stochastic programs are usually discretized; and frequently, the curse of dimensionality dictates that decision stages must be aggregated. In this article we construct two discrete, stage-aggregated stochastic programs which provide upper and lower bounds on the optimal value of the original problem. The approximate problems involve finitely many decisions and constraints, thus principally allowing for numerical solution.


Publié dans:
Mathematical Programming, 113, 1, 61-94
Année
2008
ISSN:
1436-4646
Mots-clefs:
Laboratoires:




 Notice créée le 2014-01-21, modifiée le 2019-12-05

Lien externe:
Télécharger le document
URL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)