The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Adaptive Distributionally Robust Optimization
Abstract
We develop a modular and tractable framework for solving an adaptive distributionally robust linear optimization problem, where we minimize the worst-case expected cost over an ambiguity set of probability distributions. The adaptive distributionally robust optimization framework caters for dynamic decision making, where decisions adapt to the uncertain outcomes as they unfold in stages. For tractability considerations, we focus on a class of second-order conic (SOC) representable ambiguity set, though our results can easily be extended to more general conic representations. We show that the adaptive distributionally robust linear optimization problem can be formulated as a classical robust optimization problem. To obtain a tractable formulation, we approximate the adaptive distributionally robust optimization problem using linear decision rule (LDR) techniques. More interestingly, by incorporating the primary and auxiliary random variables of the lifted ambiguity set in the LDR approximation, we can significantly improve the solutions, and for a class of adaptive distributionally robust optimization problems, exact solutions can also be obtained. Using the new LDR approximation, we can transform the distributionally adaptive robust optimization problem to a classical robust optimization problem with an SOC representable uncertainty set. Finally, to demonstrate the potential for solving management decision problems, we develop an algebraic modeling package and illustrate how it can be used to facilitate modeling and obtain high-quality solutions for medical appointment scheduling and inventory management problems. The electronic companion is available at https://doi.org/10.1287/mnsc.2017.2952 . This paper was accepted by Noah Gans, 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
Rules Rather than Discretion: The Inconsistency of Optimal Plans
Kydland, F. E., & Prescott, E. C. (1977) · Journal of Political Economy · doi:10.1086/260580 · Cited by 7,905
“Risk, Ambiguity, and the Savage Axioms.”
Ellsberg, D. (1961) · The Quarterly Journal of Economics · doi:10.2307/1884324 · Cited by 7,891
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Self-citationMaxmin 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., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Theory and Applications of Robust Optimization
Brown, D. B., Caramanis, C., & Bertsimas, D. (2010) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,524
Self-citationHandbooks in operations research and management science
Nemhauser, G. L., & Kan, A. H. G. R. (1989) · Elsevier eBooks · Cited by 2,436
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
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
Alizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
Neural systems responding to degrees of uncertainty in human decision-making
Hsu, M., Bhatt, M., Adolphs, R., Tranel, D., & Camerer, C. F. (2005) · Science · doi:10.1126/science.1115327 · Cited by 1,411
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
Solving semidefinite-quadratic-linear programs using SDPT3
T�t�nc�, R. H., Toh, K. C., & Todd, M. J. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0347-5 · Cited by 1,152
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
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
Self-citationRobust Solutions to Uncertain Semidefinite Programs
El Ghaoui, L., Oustry, F., & Lebret, H. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496305717 · Cited by 935
A Robust Optimization Approach to Inventory Theory
Bertsimas, D., & Thiele, A. (2006) · Operations Research · doi:10.1287/opre.1050.0238 · Cited by 705
Self-citationStudies 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-citationDynamic Mean-Variance Asset Allocation
Basak, S., & Chabakauri, G. (2010) · Review of Financial Studies · doi:10.1093/rfs/hhq028 · Cited by 592
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
Self-citationConstructing Uncertainty Sets for Robust Linear Optimization
Bertsimas, D., & Brown, D. B. (2009) · Operations Research · doi:10.1287/opre.1080.0646 · Cited by 343
Self-citationOn Complexity of Stochastic Programming Problems
Shapiro, A., & Nemirovski, A. (2006) · Applied Optimization · doi:10.1007/0-387-26771-9_4 · Cited by 301
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
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-citationDeriving 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
Robust Mean-Covariance Solutions for Stochastic Optimization
Popescu, I. (2007) · Operations Research · doi:10.1287/opre.1060.0353 · Cited by 235
Optimality of Affine Policies in Multistage Robust Optimization
Bertsimas, D., Iancu, D. A., & Parrilo, P. A. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0444 · Cited by 228
Self-citationAutomatic robust convex programming
Löfberg, J. (2012) · Optimization Methods and Software · doi:10.1080/10556788.2010.517532 · Cited by 227
Appointment Scheduling with Limited Distributional Information
Mak, H.-Y., Rong, Y., & Zhang, J. (2015) · Management Science · doi:10.1287/mnsc.2013.1881 · Cited by 199
Robust Approximation to Multiperiod Inventory Management
See, C.-T., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0746 · Cited by 194
Self-citationDistributionally Robust Markov Decision Processes
Xu, H., & Mannor, S. (2012) · Mathematics of Operations Research · doi:10.1287/moor.1120.0540 · Cited by 173
Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
Kong, Q., Lee, C., Teo, C., & Zheng, Z. (2013) · Operations Research · doi:10.1287/opre.2013.1158 · 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
The minimax approach to stochastic programming and an illustrative application
Dupačová, J. (1987) · Stochastics · doi:10.1080/17442508708833436 · Cited by 154
Chen, 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-citationMitigating Delays and Unfairness in Appointment Systems
Qi, J. (2016) · Management Science · doi:10.1287/mnsc.2015.2353 · Cited by 105
A Robust Optimization Model for Managing Elective Admission in a Public Hospital
Meng, F., Qi, J., Zhang, M., Ang, J. S. K., Chu, S., & Sim, M. (2015) · Operations Research · doi:10.1287/opre.2015.1423 · Cited by 60
Self-citation
Cited by
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
Ning, C., & You, F. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.03.034 · Cited by 343
Robust optimization in power systems: a tutorial overview
Conejo, A. J., & Wu, X. (2022) · Optimization and Engineering · doi:10.1007/s11081-021-09667-3 · Cited by 44
Metadata
- Authors
- Bertsimas, D., Sim, M., & Zhang, M.
- Venue
- Management Science
- Published
- 2019-02
- Volume
- 65
- Issue
- 2
- Pages
- 604-618
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2800812001
- Cited by
- 326
- References
- 42
- FWCI
- 19.99
- 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.