Data-driven robust optimization
The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1993) · doi:10.1007/978-1-4899-4541-9 · Cited by 21,230
Artzner, P., Delbaen, F., Eber, J., & Heath, D. (1999) · Mathematical Finance · doi:10.1111/1467-9965.00068 · Cited by 8,806
Optimization of conditional value-at-risk
Rockafellar, R. T., & Uryasev, S. (2000) · The Journal of Risk · doi:10.21314/jor.2000.038 · Cited by 6,725
Testing Statistical Hypotheses
(2021) · Wiley Series in Probability and Statistics · doi:10.1002/9781119243830.ch12 · Cited by 5,106
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Self-citationA survey of cross-validation procedures for model selection
Arlot, S., & Célisse, A. (2010) · LillOA (Université de Lille (University Of Lille)) · Cited by 3,669
(2012) · MPG.PuRe (Max Planck Society) · doi:10.5555/2188385.2188410 · Cited by 3,603
A survey of cross-validation procedures for model selection
Arlot, S., & Celisse, A. (2010) · Statistics Surveys · doi:10.1214/09-ss054 · Cited by 3,522 · cited 1×
“There are, of course, a wide-variety of common model selection procedures (see [2,31]), some of which may be more appropriate to the specific application than others.”
BackgroundEDF Statistics for Goodness of Fit and Some Comparisons
Stephens, M. A. (1974) · Journal of the American Statistical Association · doi:10.1080/01621459.1974.10480196 · Cited by 3,166
Mathematical Statistics and Data Analysis
Rabinowitz, L. (1989) · Technometrics · doi:10.1080/00401706.1989.10488573 · Cited by 3,116
Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831050 · Cited by 2,895
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
Robust solutions of Linear Programming problems contaminated with uncertain data
Ben-Tal, A., & Nemirovski, A. (2000) · Mathematical Programming · doi:10.1007/pl00011380 · Cited by 1,744
On the coherence of expected shortfall
Acerbi, C., & Tasche, D. (2002) · Journal of Banking & Finance · doi:10.1016/s0378-4266(02)00283-2 · Cited by 1,584
Convex Approximations of Chance Constrained Programs
Nemirovski, A., & Shapiro, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050622328 · Cited by 1,160
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
Robust Portfolio Selection Problems
Goldfarb, D., & Iyengar, G. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.1.1.14260 · Cited by 895
The theory of queues with a single server
Lindley, D. V. (1952) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100027638 · Cited by 875
Robust Solutions of Optimization Problems Affected by Uncertain Probabilities
Ben-Tal, A., den Hertog, D., De Waegenaere, A., Melenberg, B., & Rennen, G. (2013) · Management Science · doi:10.1287/mnsc.1120.1641 · Cited by 748
Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications
Ben-Tal, A., & Nemirovski, A. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718829 · Cited by 747
Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Ghaoui, L. E., Oks, M., & Oustry, F. (2003) · Operations Research · doi:10.1287/opre.51.4.543.16101 · Cited by 662
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Campi, M. C., & Garatti, S. (2008) · SIAM Journal on Optimization · doi:10.1137/07069821x · Cited by 560
On Distributionally Robust Chance-Constrained Linear Programs
Calafiore, G. C., & Ghaoui, L. E. (2006) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-006-9084-x · Cited by 508
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
Bertsimas, D., & Popescu, I. (2005) · SIAM Journal on Optimization · doi:10.1137/s1052623401399903 · Cited by 428
Self-citationA Robust Optimization Perspective on Stochastic Programming
Chen, X., Sim, M., & Sun, P. (2007) · Operations Research · doi:10.1287/opre.1070.0441 · Cited by 362
Constructing Uncertainty Sets for Robust Linear Optimization
Bertsimas, D., & Brown, D. B. (2009) · Operations Research · doi:10.1287/opre.1080.0646 · Cited by 343
Self-citationRetailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach
Ben-Tal, A., Golany, B., Nemirovski, A., & Vial, J.-P. (2005) · Manufacturing & Service Operations Management · doi:10.1287/msom.1050.0081 · Cited by 322
From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
Chen, W., Sim, M., Sun, J., & Teo, C.-P. (2010) · Operations Research · doi:10.1287/opre.1090.0712 · Cited by 318
On Duality Theory of Conic Linear Problems
Shapiro, A. (2001) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3403-4_7 · Cited by 312
Using copulae to bound the Value-at-Risk for functions of dependent risks
Paul Embrechts, A., Höing, A., & Juri, A. (2003) · Finance and Stochastics · doi:10.1007/s007800200085 · Cited by 277
Mathematical Statistics and Data Analysis.
Leonard, T., & Rice, J. A. (1989) · Journal of the American Statistical Association · doi:10.2307/2289973 · Cited by 269
Deriving robust counterparts of nonlinear uncertain inequalities
Ben-Tal, A., den Hertog, D., & Vial, J.-P. (2015) · Mathematical Programming · doi:10.1007/s10107-014-0750-8 · Cited by 246
Cutting-set methods for robust convex optimization with pessimizing oracles
Mutapcic, A., & Boyd, S. (2009) · Optimization Methods and Software · doi:10.1080/10556780802712889 · Cited by 170
Constructing Risk Measures from Uncertainty Sets
Natarajan, K., Pachamanova, D., & Sim, M. (2009) · Operations Research · doi:10.1287/opre.1080.0683 · Cited by 165
Tractable stochastic analysis in high dimensions via robust optimization
Bandi, C., & Bertsimas, D. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0567-2 · Cited by 158
Self-citationMohajerin Esfahani, P., & Kuhn, D. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1172-1 · Cited by 136
Goodness-of-fit tests via phi-divergences
Jager, L. R., & Wellner, J. A. (2007) · The Annals of Statistics · doi:10.1214/0009053607000000244 · Cited by 134
Thas, O. (2010) · Springer series in statistics · doi:10.1007/978-0-387-92710-7 · Cited by 124
On Multivariate Goodness-of-Fit and Two-Sample Testing
Friedman, J. H. (2004) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/826696 · Cited by 96
Thas, O. (2009) · Springer series in statistics · doi:10.1007/b99044 · Cited by 93
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
Lan, G. (2013) · Mathematical Programming · doi:10.1007/s10107-013-0737-x · Cited by 81
Bandi, C., Bertsimas, D., & Youssef, N. (2015) · Operations Research · doi:10.1287/opre.2015.1367 · Cited by 79
Self-citationOracle-Based Robust Optimization via Online Learning
Ben‐Tal, A., Hazan, E., Koren, T., & Mannor, S. (2015) · Operations Research · doi:10.1287/opre.2015.1374 · Cited by 62
Robust Sample Average ApproximationPreprint
Bertsimas, D., Gupta, V., & Kallus, N. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.4445 · Cited by 8
Self-citation
Cited by
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2020) · Management Science · doi:10.1287/mnsc.2018.3253 · Cited by 784
Self-citationFrom Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2014) · arXiv · doi:10.48550/arxiv.1402.5481 · Cited by 783
Self-citationSmart “Predict, then Optimize”
Elmachtoub, A. N., & Grigas, P. (2022) · Management Science · doi:10.1287/mnsc.2020.3922 · Cited by 773
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
Frameworks and Results in Distributionally Robust Optimization
Rahimian, H., & Mehrotra, S. (2022) · Open Journal of Mathematical Optimization · doi:10.5802/ojmo.15 · Cited by 506
Metadata
- Authors
- Bertsimas, D., Gupta, V., & Kallus, N.
- Venue
- Mathematical Programming
- Published
- 2017-02-25
- Volume
- 167
- Issue
- 2
- Pages
- 235-292
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1542523037
- Cited by
- 611
- References
- 51
- FWCI
- 44.74
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.