The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Distributionally Robust Optimization and Its Tractable Approximations
Abstract
In this paper we focus on a linear optimization problem with uncertainties, having expectations in the objective and in the set of constraints. We present a modular framework to obtain an approximate solution to the problem that is distributionally robust and more flexible than the standard technique of using linear rules. Our framework begins by first affinely extending the set of primitive uncertainties to generate new linear decision rules of larger dimensions and is therefore more flexible. Next, we develop new piecewise-linear decision rules that allow a more flexible reformulation of the original problem. The reformulated problem will generally contain terms with expectations on the positive parts of the recourse variables. Finally, we convert the uncertain linear program into a deterministic convex program by constructing distributionally robust bounds on these expectations. These bounds are constructed by first using different pieces of information on the distribution of the underlying uncertainties to develop separate bounds and next integrating them into a combined bound that is better than each of the individual bounds.
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
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
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
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Self-citationBen-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Stochastic Programming: The State of the Art In Honor of George B. Dantzig
(2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1642-6 · Cited by 2,239
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
Robust solutions of uncertain linear programs
Ben-Tal, A., & Nemirovski, A. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(99)00016-4 · Cited by 1,829
Soyster, A. L. (1973) · Operations Research · doi:10.1287/opre.21.5.1154 · Cited by 1,822
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
Convex measures of risk and trading constraints
Föllmer, H., & Schied, A. (2002) · Finance and Stochastics · doi:10.1007/s007800200072 · Cited by 1,447
Adjustable robust solutions of uncertain linear programs
Ben-Tal, A., Goryashko, A., Guslitzer, E., & Nemirovski, A. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0454-y · Cited by 1,380
Robust Solutions to Least-Squares Problems with Uncertain Data
El Ghaoui, L., & Lebret, H. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896298130 · Cited by 1,076
Robust Solutions to Uncertain Semidefinite Programs
El Ghaoui, L., Oustry, F., & Lebret, H. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496305717 · Cited by 935
Adjustable robust solutions of uncertain linear programs
Ben-TalA., GoryashkoA., GuslitzerE., et al. (2004) · Mathematical Programming · doi:10.5555/2990016.3114320 · Cited by 849
A Robust Optimization Approach to Inventory Theory
Bertsimas, D., & Thiele, A. (2006) · Operations Research · doi:10.1287/opre.1050.0238 · Cited by 705
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
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
Robust solution to least squares problems with uncertain data
Ghaoui, L. E., & Lebret, H. (1997) · Cited by 638
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
A Robust Optimization Perspective on Stochastic Programming
Chen, X., Sim, M., & Sun, P. (2007) · Operations Research · doi:10.1287/opre.1070.0441 · Cited by 362
Self-citationMatching Supply with Demand: An Introduction to Operations Management
Cachon, G. P., & Terwiesch, C. (2005) · Cited by 359
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
Bayes Solutions of the Statistical Inventory Problem
Scarf, H. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706264 · Cited by 318
On Complexity of Stochastic Programming Problems
Shapiro, A., & Nemirovski, A. (2006) · Applied Optimization · doi:10.1007/0-387-26771-9_4 · Cited by 301
A Linear Decision-Based Approximation Approach to Stochastic Programming
Chen, X., Sim, M., Sun, P., & Zhang, J. (2008) · Operations Research · doi:10.1287/opre.1070.0457 · Cited by 248
Self-citationRobust Mean-Covariance Solutions for Stochastic Optimization
Popescu, I. (2007) · Operations Research · doi:10.1287/opre.1060.0353 · Cited by 235
Robust Approximation to Multiperiod Inventory Management
See, C.-T., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0746 · Cited by 194
Self-citationExpected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming
Ben-Tal, A., & Teboulle, M. (1986) · Management Science · doi:10.1287/mnsc.32.11.1445 · Cited by 170
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
The minimax approach to stochastic programming and an illustrative application
Dupačová, J. (1987) · Stochastics · doi:10.1080/17442508708833436 · Cited by 154
TRACTABLE ROBUST EXPECTED UTILITY AND RISK MODELS FOR PORTFOLIO OPTIMIZATION
Natarajan, K., Sim, M., & UICHANCO, J. A. V. (2010) · Mathematical Finance · doi:10.1111/j.1467-9965.2010.00417.x · Cited by 129
Self-citationChen, W., & Sim, M. (2009) · Operations Research · doi:10.1287/opre.1080.0570 · Cited by 107
Self-citationRobust Optimization Made Easy with ROME
Goh, J., & Sim, M. (2011) · Operations Research · doi:10.1287/opre.1110.0944 · Cited by 105
Self-citation
Cited by
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
Self-citationRecent 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
Deep Long-Tailed Learning: A Survey
Zhang, Y., Kang, B., Hooi, B., Yan, S., & Feng, J. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3268118 · Cited by 769
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
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
Metadata
- Authors
- Goh, J., & Sim, M.
- Venue
- Operations Research
- Published
- 2010-08
- Volume
- 58
- Issue
- 4-part-1
- Pages
- 902-917
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2119303899
- Cited by
- 668
- References
- 34
- FWCI
- 25.29
- 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.