The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Constructing Uncertainty Sets for Robust Linear Optimization
Abstract
In this paper, we propose a methodology for constructing uncertainty sets within the framework of robust optimization for linear optimization problems with uncertain parameters. Our approach relies on decision maker risk preferences. Specifically, we utilize the theory of coherent risk measures initiated by Artzner et al. (1999) [Artzner, P., F. Delbaen, J. Eber, D. Heath. 1999. Coherent measures of risk. Math. Finance 9 203–228.], and show that such risk measures, in conjunction with the support of the uncertain parameters, are equivalent to explicit uncertainty sets for robust optimization. We explore the structure of these sets in detail. In particular, we study a class of coherent risk measures, called distortion risk measures, which give rise to polyhedral uncertainty sets of a special structure that is tractable in the context of robust optimization. In the case of discrete distributions with rational probabilities, which is useful in practical settings when we are sampling from data, we show that the class of all distortion risk measures (and their corresponding polyhedral sets) are generated by a finite number of conditional value-at-risk (CVaR) measures. A subclass of the distortion risk measures corresponds to polyhedral uncertainty sets symmetric through the sample mean. We show that this subclass is also finitely generated and can be used to find inner approximations to arbitrary, polyhedral uncertainty sets.
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
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
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
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
Adaptive Distributionally Robust Optimization
Bertsimas, D., Sim, M., & Zhang, M. (2019) · Management Science · doi:10.1287/mnsc.2017.2952 · Cited by 326
Self-citationFrom 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
Offering Strategy Via Robust Optimization
Baringo, L., & Conejo, A. J. (2011) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2010.2092793 · Cited by 165
Metadata
- Authors
- Bertsimas, D., & Brown, D. B.
- Venue
- Operations Research
- Published
- 2009-12
- Volume
- 57
- Issue
- 6
- Pages
- 1483-1495
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2109427113
- Cited by
- 343
- References
- 1
- FWCI
- 20.75
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Constructing Uncertainty Sets for Robust Linear Optimization. https://app.cochat.ai/papers/10.1287/opre.1080.0646
- The paper
- Bertsimas, D., & Brown, D. B. (2009). Constructing Uncertainty Sets for Robust Linear Optimization. Operations Research. https://doi.org/10.1287/opre.1080.0646
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.