The solution of a multistage stochastic programming problem needs a suitable representation of uncertainty which may be obtained through a satisfactory scenario tree construction. There is a trade-off between the level of accuracy in the description of the stochastic component and the computational tractability of the resulting scenario-based problem. In order to face such a trade-off which plays a crucial role in the determination of the optimal solution, we discuss methods that allow progressive reductions of a given scenario tree by means of spatial aggregation. In this process it is important to take into account the choice of proper aggregation criteria in order to try to preserve all the relevant information. © Springer 2008, Milan.
Spatial aggregation in scenario tree reduction
Ciurlia P.
2008-01-01
Abstract
The solution of a multistage stochastic programming problem needs a suitable representation of uncertainty which may be obtained through a satisfactory scenario tree construction. There is a trade-off between the level of accuracy in the description of the stochastic component and the computational tractability of the resulting scenario-based problem. In order to face such a trade-off which plays a crucial role in the determination of the optimal solution, we discuss methods that allow progressive reductions of a given scenario tree by means of spatial aggregation. In this process it is important to take into account the choice of proper aggregation criteria in order to try to preserve all the relevant information. © Springer 2008, Milan.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
