The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Robust Solutions of Optimization Problems Affected by Uncertain Probabilities
Abstract
In this paper we focus on robust linear optimization problems with uncertainty regions defined by ϕ-divergences (for example, chi-squared, Hellinger, Kullback–Leibler). We show how uncertainty regions based on ϕ-divergences arise in a natural way as confidence sets if the uncertain parameters contain elements of a probability vector. Such problems frequently occur in, for example, optimization problems in inventory control or finance that involve terms containing moments of random variables, expected utility, etc. We show that the robust counterpart of a linear optimization problem with ϕ-divergence uncertainty is tractable for most of the choices of ϕ typically considered in the literature. We extend the results to problems that are nonlinear in the optimization variables. Several applications, including an asset pricing example and a numerical multi-item newsvendor example, illustrate the relevance of the proposed approach. This paper was accepted by Gérard P. Cachon, optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Artzner, P., Delbaen, F., Eber, J., & Heath, D. (1999) · Mathematical Finance · doi:10.1111/1467-9965.00068 · Cited by 8,806
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
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
Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831050 · Cited by 2,895
Self-citationBen-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Self-citationTheory and Applications of Robust Optimization
Brown, D. B., Caramanis, C., & Bertsimas, D. (2010) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,524
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
Cited by
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
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
A practical guide to robust optimization
Gorissen, B. L., Yanıkoğlu, İ., & den Hertog, D. (2015) · Omega · doi:10.1016/j.omega.2014.12.006 · Cited by 636
Self-citationDistributionally Robust Stochastic Optimization with Wasserstein Distance
Gao, R., & Kleywegt, A. (2023) · Mathematics of Operations Research · doi:10.1287/moor.2022.1275 · Cited by 630
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
Data-driven chance constrained stochastic program
Jiang, R., & Guan, Y. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0929-7 · Cited by 485
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
Sagawa, S., Koh, P. W., Hashimoto, T., & Liang, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.08731 · Cited by 331
Data-Driven Stochastic Unit Commitment for Integrating Wind Generation
Zhao, C., & Guan, Y. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2477311 · Cited by 279
Mohajerin Esfahani, P., & Kuhn, D. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1172-1 · Cited by 136
Measure and Improve Robustness in NLP Models: A Survey
Wang, X., Wang, H., & Yang, D. (2022) · Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/2022.naacl-main.339 · Cited by 90
(2019) · doi:10.18653/v1/d19-1432 · Cited by 88
MEMO: Test Time Robustness Via Adaptation and Augmentation
Zhang, M., Levine, S., & Finn, C. (2022) · Advances in Neural Information Processing Systems 35 · doi:10.52202/068431-2799 · Cited by 189
Large-scale methods for distributionally robust optimization
Levy, D., Carmon, Y., Duchi, J. C., & Sidford, A. (2020) · arXiv · doi:10.48550/arxiv.2010.05893 · Cited by 52
“Distributionally robust optimization (DRO) [3, 66] shows promise as a way to address this challenge, with recent interest in both the machine learning community [68, 74, 22, 69, 34, 55] and in operations research [20, 3, 5, 27].”
BackgroundMethodInfluentialBootstrap Robust Prescriptive Analytics
Bertsimas, D., & Van Parys, B. (2017) · arXiv · doi:10.48550/arxiv.1711.09974 · Cited by 51
Pfohl, S., Xu, Y., Foryciarz, A., Ignatiadis, N., Genkins, J., & Shah, N. (2022) · 2022 ACM Conference on Fairness Accountability and Transparency · doi:10.1145/3531146.3533166 · Cited by 30
An Investigation of Critical Issues in Bias Mitigation Techniques
Shrestha, R., Kafle, K., & Kanan, C. (2022) · 2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) · doi:10.1109/wacv51458.2022.00257 · Cited by 22
Why do classifier accuracies show linear trends under distribution shift?
Mania, H., & Sra, S. (2020) · arXiv · doi:10.48550/arxiv.2012.15483 · Cited by 3
Metadata
- Authors
- Ben-Tal, A., den Hertog, D., De Waegenaere, A., Melenberg, B., & Rennen, G.
- Venue
- Management Science
- Published
- 2013-02
- Volume
- 59
- Issue
- 2
- Pages
- 341-357
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W1484551447
- Cited by
- 748
- References
- 33
- FWCI
- 21.49
- 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.