The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Distributionally Robust Convex Optimization
Open accessAbstract
Distributionally robust optimization is a paradigm for decision making under uncertainty where the uncertain problem data are governed by a probability distribution that is itself subject to uncertainty. The distribution is then assumed to belong to an ambiguity set comprising all distributions that are compatible with the decision maker’s prior information. In this paper, we propose a unifying framework for modeling and solving distributionally robust optimization problems. We introduce standardized ambiguity sets that contain all distributions with prescribed conic representable confidence sets and with mean values residing on an affine manifold. These ambiguity sets are highly expressive and encompass many ambiguity sets from the recent literature as special cases. They also allow us to characterize distributional families in terms of several classical and/or robust statistical indicators that have not yet been studied in the context of robust optimization. We determine conditions under which distributionally robust optimization problems based on our standardized ambiguity sets are computationally tractable. We also provide tractable conservative approximations for problems that violate these conditions.
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
(1979) · Cited by 43,841
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149
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
Introduction to Stochastic Programming
Birge, J. R., & Louveaux, F. (2011) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-1-4614-0237-4 · Cited by 6,469
Casella, G., & Berger, R. (2024) · Chapman & Hall/CRC eBooks · doi:10.1201/9781003456285 · Cited by 5,711
Combinatorial optimization. Polyhedra and efficiency.
Schrijver, A. (2003) · UvA-DARE (University of Amsterdam) · Cited by 4,637
Maxmin expected utility with non-unique prior
Gilboa, I., & Schmeidler, D. (1989) · Journal of Mathematical Economics · doi:10.1016/0304-4068(89)90018-9 · Cited by 4,040
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831050 · Cited by 2,895
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Keynes, J. M. (1973) · Palgrave Macmillan UK eBooks · doi:10.1007/978-1-349-00843-8 · Cited by 2,575
Theory and Applications of Robust Optimization
Brown, D. B., Caramanis, C., & Bertsimas, D. (2010) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,524
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
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
Prékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
Alizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
Convex measures of risk and trading constraints
Föllmer, H., & Schied, A. (2002) · Finance and Stochastics · doi:10.1007/s007800200072 · Cited by 1,447
The Markowitz Optimization Enigma: Is ‘Optimized’ Optimal?
Michaud, R. O. (1989) · Financial Analysts Journal · doi:10.2469/faj.v45.n1.31 · Cited by 1,328
Bootstrap Methods: A Guide for Practitioners and Researchers
Chernick, M. R. (2007) · Cited by 796
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
(2001) · Empirical Direction in Design and Analysis · doi:10.4324/9781410600004-7 · Cited by 717
Distributionally robust joint chance constraints with second-order moment information
Zymler, S., Kühn, D., & Rüstem, B. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0494-7 · Cited by 710
Studies in Mathematical Theory of Inventory and Production
Vadja, S., Arrow, K. J., Karlin, S., Scarf, H., Hurwicz, L., & Uzawa, H. (1959) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402060 · Cited by 696
Distributionally Robust Optimization and Its Tractable Approximations
Goh, J., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0795 · Cited by 668
Self-citationSDPT3 -- A Matlab Software Package for Semidefinite Programming
Toh, K.-C., Todd, M. J., & Tütüncü, R. H. (1996) · eCommons (Cornell University) · Cited by 663
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
A Min-Max Solution of an Inventory Problem
Scarf, H. (2005) · Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research · doi:10.1057/9781137024381_3 · Cited by 552
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
A Definition of Uncertainty Aversion
Epstein, L. G. (1999) · Review of Economic Studies · doi:10.1111/1467-937x.00099 · Cited by 498
Ruszczyński, A., & Shapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10001-1 · Cited by 452
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
AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
Ben‐Tal, A., & Teboulle, M. (2007) · Mathematical Finance · doi:10.1111/j.1467-9965.2007.00311.x · Cited by 353
Constructing Uncertainty Sets for Robust Linear Optimization
Bertsimas, D., & Brown, D. B. (2009) · Operations Research · doi:10.1287/opre.1080.0646 · Cited by 343
Portfolio Selection with Robust Estimation
DeMiguel, V., & Nogales, F. J. (2009) · Operations Research · doi:10.1287/opre.1080.0566 · Cited by 324
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
Self-citationRobust Markov Decision Processes
Wiesemann, W., Kuhn, D., & Rustem, B. (2013) · Mathematics of Operations Research · doi:10.1287/moor.1120.0566 · Cited by 312
Self-citationOn 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
Tractable Approximations to Robust Conic Optimization Problems
Bertsimas, D., & Sim, M. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0677-1 · Cited by 297
Self-citationThe Data-Driven Newsvendor Problem: New Bounds and Insights
Levi, R., Perakis, G., & Uichanco, J. (2015) · Operations Research · doi:10.1287/opre.2015.1422 · Cited by 256
Primal and dual linear decision rules in stochastic and robust optimization
Kuhn, D., Wiesemann, W., & Georghiou, A. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0331-4 · Cited by 256
Self-citationKullback-Leibler divergence constrained distributionally robust optimization
Hu, Z., & Hong, L. J. (2012) · Cited by 221
Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
Bertsimas, D., Doan, X. V., Natarajan, K., & Teo, C.-P. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0445 · Cited by 214
Distributionally Robust Markov Decision Processes
Xu, H., & Mannor, S. (2012) · Mathematics of Operations Research · doi:10.1287/moor.1120.0540 · Cited by 173
Distributionally robust multi-item newsvendor problems with multimodal demand distributions
Hanasusanto, G. A., Kuhn, D., Wallace, S. W., & Zymler, S. (2015) · Mathematical Programming · doi:10.1007/s10107-014-0776-y · Cited by 166
Self-citationConstructing Risk Measures from Uncertainty Sets
Natarajan, K., Pachamanova, D., & Sim, M. (2009) · Operations Research · doi:10.1287/opre.1080.0683 · Cited by 165
Self-citationA Soft Robust Model for Optimization Under Ambiguity
Ben‐Tal, A., Bertsimas, D., & Brown, D. B. (2010) · Operations Research · doi:10.1287/opre.1100.0821 · Cited by 158
On minimax solutions of stochastic linear programming problems
Žáčková, J. (1966) · Časopis pro pěstování matematiky · doi:10.21136/cpm.1966.117583 · Cited by 158
Satisficing Measures for Analysis of Risky Positions
Brown, D. B., & Sim, M. (2008) · Management Science · doi:10.1287/mnsc.1080.0929 · Cited by 132
Self-citationChen, W., & Sim, M. (2009) · Operations Research · doi:10.1287/opre.1080.0570 · Cited by 107
Self-citationAspirational Preferences and Their Representation by Risk Measures
Brown, D. B., Giorgi, E. G. D., & Sim, M. (2011) · Management Science · doi:10.1287/mnsc.1120.1537 · Cited by 69
Self-citationA Distributional Interpretation of Robust Optimization
Xu, H., Caramanis, C., & Mannor, S. (2012) · Mathematics of Operations Research · doi:10.1287/moor.1110.0531 · Cited by 47
Multiple Objectives Satisficing Under Uncertainty
Lam, S., Ng, T. S., Sim, M., & Song, J.-H. (2013) · Operations Research · doi:10.1287/opre.1120.1132 · Cited by 26
Self-citationDistributionally robust mixed integer linear programs: Persistency models with applications
Li, X., Natarajan, K., Teo, C., & Zheng, Z. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.07.009 · Cited by 23
Cited by
Recent advances in robust optimization: An overview
Gabrel, V., Murat, C., & Thiele, A. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.09.036 · Cited by 912
Supply chain network design under uncertainty: A comprehensive review and future research directions
Govindan, K., Fattahi, M., & Keyvanshokooh, E. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.04.009 · Cited by 705
Data-driven robust optimization
Bertsimas, D., Gupta, V., & Kallus, N. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1125-8 · Cited by 611
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
Quantifying Distributional Model Risk via Optimal Transport
Blanchet, J., & Murthy, K. (2019) · Mathematics of Operations Research · doi:10.1287/moor.2018.0936 · Cited by 350
Metadata
- Authors
- Wiesemann, W., Kuhn, D., & Sim, M.
- Venue
- Operations Research
- Published
- 2014-12
- Volume
- 62
- Issue
- 6
- Pages
- 1358-1376
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2125417745
- Cited by
- 947
- References
- 55
- FWCI
- 39.43
- Type
- journal article
- Language
- en
- Open access
- green
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.