Optimality of Affine Policies in Multistage Robust Optimization
Top Cited Papers
Open Access
- 1 May 2010
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 35 (2) , 363-394
Abstract
In this paper, we prove the optimality of disturbance-affine control policies in the context of one-dimensional, constrained, multistage robust optimization. Our results cover the finite-horizon case, with minimax (worst-case) objective, and convex state costs plus linear control costs. We develop a new proof methodology, which explores the relationship between the geometrical properties of the feasible set of solutions and the structure of the objective function. Apart from providing an elegant and conceptually simple proof technique, the approach also entails very fast algorithms for the case of piecewise-affine state costs, which we explore in connection with a classical inventory management application.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Robust linear optimization under general normsOperations Research Letters, 2004
- Adjustable robust solutions of uncertain linear programsMathematical Programming, 2004
- Min-max control of constrained uncertain discrete-time linear systemsIEEE Transactions on Automatic Control, 2003
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Robust optimization ? methodology and applicationsMathematical Programming, 2002
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic ProblemsSIAM Journal on Optimization, 2002
- Robust solutions of uncertain linear programsOperations Research Letters, 1999
- Robust Solutions to Uncertain Semidefinite ProgramsSIAM Journal on Optimization, 1998
- Robustness in the presence of mixed parametric uncertainty and unmodeled dynamicsIEEE Transactions on Automatic Control, 1991
- On the minimax reachability of target sets and target tubesAutomatica, 1971