Theory and Applications of Robust Optimization

被引:1687
作者
Bertsimas, Dimitris [1 ,2 ]
Brown, David B. [3 ]
Caramanis, Constantine [4 ]
机构
[1] MIT, Alfred P Sloan Sch Management, Cambridge, MA 02139 USA
[2] MIT, Ctr Operat Res, Cambridge, MA 02139 USA
[3] Duke Univ, Fuqua Sch Business, Durham, NC 27708 USA
[4] Univ Texas Austin, Dept Elect & Comp Engn, Austin, TX 78712 USA
关键词
robust optimization; robustness; adaptable optimization; applications of robust optimization; MAXIMUM-LIKELIHOOD-ESTIMATION; CONVEX-OPTIMIZATION; TRACTABLE APPROXIMATIONS; AT-RISK; MODEL; REPRESENTATION; INEQUALITIES; UNCERTAINTY; SELECTION; DESIGN;
D O I
10.1137/080734510
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper we survey the primary research, both theoretical and applied, in the area of robust optimization (RO). Our focus is on the computational attractiveness of RO approaches, as well as the modeling power and broad applicability of the methodology. In addition to surveying prominent theoretical results of RO, we also present some recent results linking RO to adaptable models for multistage decision-making problems. Finally, we highlight applications of RO across a wide spectrum of domains, including finance, statistics, learning, and various areas of engineering.
引用
收藏
页码:464 / 501
页数:38
相关论文
共 137 条
[1]  
[Anonymous], 1997, Introduction to stochastic programming
[2]  
[Anonymous], 1996, Neuro-dynamic programming
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[4]  
[Anonymous], RETRIEVAL, DOI DOI 10.1561/1500000011
[5]  
[Anonymous], 2013, Stochastic Programming
[6]  
[Anonymous], 1971, Lecture notes in math
[7]   Coherent measures of risk [J].
Artzner, P ;
Delbaen, F ;
Eber, JM ;
Heath, D .
MATHEMATICAL FINANCE, 1999, 9 (03) :203-228
[8]   Two-stage robust network row and design under demand uncertahty [J].
Atamtuerk, Alper ;
Zhang, Muhong .
OPERATIONS RESEARCH, 2007, 55 (04) :662-673
[9]   Strong formulations of robust mixed 0-1 programming [J].
Atamtuerk, Alper .
MATHEMATICAL PROGRAMMING, 2006, 108 (2-3) :235-250
[10]  
Banerjee O, 2008, J MACH LEARN RES, V9, P485