Article ID: | iaor20091378 |
Country: | Germany |
Volume: | 2 |
Issue: | 2 |
Start Page Number: | 267 |
End Page Number: | 280 |
Publication Date: | Mar 2008 |
Journal: | Optimization Letters |
Authors: | Rustem Ber, Pistikopoulos Efstratios N., Fasca Nuno P., Saraiva Pedro M., Kouramas Konstantinos I. |
Keywords: | programming: parametric |
In this work, we present a new algorithm for solving complex multi-stage optimization problems involving hard constraints and uncertainties, based on dynamic and multi-parametric programming techniques. Each echelon of the dynamic programming procedure, typically employed in the context of multi-stage optimization models, is interpreted as a multi-parametric optimization problem, with the present states and future decision variables being the parameters, while the present decisions the corresponding optimization variables. This reformulation significantly reduces the dimension of the original problem, essentially to a set of lower dimensional multi-parametric programs, which are sequentially solved. Furthermore, the use of sensitivity analysis circumvents non-convexities that naturally arise in constrained dynamic programming problems. The potential application of the proposed novel framework to robust constrained optimal control is highlighted.