Data-driven robust optimization

被引:403
作者
Bertsimas, Dimitris [1 ]
Gupta, Vishal [2 ]
Kallus, Nathan [3 ,4 ]
机构
[1] MIT, Sloan Sch Management, 77 Massachusetts Ave, Cambridge, MA 02139 USA
[2] Univ Southern Calif, Marshall Sch Business, Los Angeles, CA 90029 USA
[3] Cornell Univ, Sch Operat Res & Informat Engn, New York, NY 10011 USA
[4] Cornell Tech, New York, NY 10011 USA
基金
美国国家科学基金会;
关键词
Robust optimization; Data-driven optimization; Chance-constraints; Hypothesis testing; GOODNESS-OF-FIT; VALUE-AT-RISK; UNCERTAINTY;
D O I
10.1007/s10107-017-1125-8
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The last decade witnessed an explosion in the availability of data for operations research applications. Motivated by this growing availability, we propose a novel schema for utilizing data to design uncertainty sets for robust optimization using statistical hypothesis tests. The approach is flexible and widely applicable, and robust optimization problems built from our new sets are computationally tractable, both theoretically and practically. Furthermore, optimal solutions to these problems enjoy a strong, finite-sample probabilistic guarantee whenever the constraints and objective function are concave in the uncertainty. We describe concrete procedures for choosing an appropriate set for a given application and applying our approach to multiple uncertain constraints. Computational evidence in portfolio management and queueing confirm that our data-driven sets significantly outperform traditional robust optimization techniques whenever data are available.
引用
收藏
页码:235 / 292
页数:58
相关论文
共 50 条
[1]   On the coherence of expected shortfall [J].
Acerbi, C ;
Tasche, D .
JOURNAL OF BANKING & FINANCE, 2002, 26 (07) :1487-1503
[2]  
[Anonymous], 2009, ELEMENTS STAT LEARNI
[3]  
[Anonymous], ARXIV150505116
[4]  
[Anonymous], 2007, MATH STAT DATA ANAL
[5]  
[Anonymous], 1981, Order Statistics
[6]  
[Anonymous], 1996, J ECON LIT
[7]   A survey of cross-validation procedures for model selection [J].
Arlot, Sylvain ;
Celisse, Alain .
STATISTICS SURVEYS, 2010, 4 :40-79
[8]   Robust Queueing Theory [J].
Bandi, Chaithanya ;
Bertsimas, Dimitris ;
Youssef, Nataly .
OPERATIONS RESEARCH, 2015, 63 (03) :676-700
[9]   Tractable stochastic analysis in high dimensions via robust optimization [J].
Bandi, Chaithanya ;
Bertsimas, Dimitris .
MATHEMATICAL PROGRAMMING, 2012, 134 (01) :23-70
[10]   Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424