The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Robust Optimization of Large-Scale Systems
Abstract
Mathematical programming models with noisy, erroneous, or incomplete data are common in operations research applications. Difficulties with such data are typically dealt with reactively—through sensitivity analysis—or proactively—through stochastic programming formulations. In this paper, we characterize the desirable properties of a solution to models, when the problem data are described by a set of scenarios for their value, instead of using point estimates. A solution to an optimization model is defined as: solution robust if it remains “close” to optimal for all scenarios of the input data, and model robust if it remains “almost” feasible for all data scenarios. We then develop a general model formulation, called robust optimization (RO), that explicitly incorporates the conflicting objectives of solution and model robustness. Robust optimization is compared with the traditional approaches of sensitivity analysis and stochastic linear programming. The classical diet problem illustrates the issues. Robust optimization models are then developed for several real-world applications: power capacity expansion; matrix balancing and image reconstruction; air-force airline scheduling; scenario immunization for financial planning; and minimum weight structural design. We also comment on the suitability of parallel and distributed computer architectures for the solution of robust optimization models.
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
Theory of games and economic behavior
(2019) · 100 Years of Math Milestones · doi:10.1090/mbk/121/32 · Cited by 16,632
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Decisions with Multiple Objectives: Preferences and Value Trade-Offs
Keeney, R. L., & Raiffa, H. (1993) · Cambridge University Press eBooks · doi:10.1017/cbo9781139174084 · Cited by 4,426
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
Image reconstruction from projections : the fundamentals of computerized tomography
Herman, G. T. (1980) · Academic Press eBooks · Cited by 1,993
Hillis, W. D. (1987) · Scientific American · doi:10.1038/scientificamerican0687-108 · Cited by 1,635
Linear Programming Under Uncertainty
Dantzig, G. B. (2004) · Management Science · doi:10.1287/mnsc.1040.0261 · Cited by 1,173
Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
Wahba, G. (1977) · SIAM Journal on Numerical Analysis · doi:10.1137/0714044 · Cited by 798
Importance Sampling for Stochastic Simulations
Glynn, P. W., & Iglehart, D. L. (1989) · Management Science · doi:10.1287/mnsc.35.11.1367 · Cited by 635
On Minimizing a Convex Function Subject to Linear Inequalities
Beale, E. M. L. (1955) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1955.tb00191.x · Cited by 625
Cited by
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
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 discrete optimization and network flows
Bertsimas, D., & Sim, M. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0396-4 · Cited by 1,799
Robust optimization – A comprehensive survey
Beyer, H.-G., & Sendhoff, B. (2007) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2007.03.003 · Cited by 1,594
Strategic facility location: A review
Owen, S. H., & Daskin, M. S. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00186-6 · Cited by 1,380
Convex Approximations of Chance Constrained Programs
Nemirovski, A., & Shapiro, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050622328 · Cited by 1,160
Robust Discrete Optimization and Its Applications.
Gerodimos, A., Kouvelis, P., & Yu, G. (1998) · The Journal of the Operational Research Society · doi:10.2307/3010157 · Cited by 1,060
Facility location under uncertainty: a review
Snyder, L. V. (2006) · IIE Transactions · doi:10.1080/07408170500216480 · Cited by 1,019
Baryannis, G., Validi, S., Dani, S., & Antoniou, G. (2019) · International Journal of Production Research · doi:10.1080/00207543.2018.1530476 · Cited by 1,015
The design of robust value-creating supply chain networks: A critical review
Klibi, W., Martel, A., & Guitouni, A. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.06.011 · Cited by 870
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
Multiple criteria facility location problems: A survey
Farahani, R. Z., SteadieSeifi, M., & Asgari, N. (2010) · Applied Mathematical Modelling · doi:10.1016/j.apm.2009.10.005 · Cited by 661
Uncertain convex programs: randomized solutions and confidence levels
Calafiore, G., & Campi, M. C. (2005) · Mathematical Programming · doi:10.1007/s10107-003-0499-y · Cited by 659
Computational methods in optimization considering uncertainties – An overview
Schuëller, G. I., & Jensen, H. A. (2008) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2008.05.004 · Cited by 572
Review of uncertainty-based multidisciplinary design optimization methods for aerospace vehicles
Yao, W., Chen, X., Luo, W., van Tooren, M., & Guo, J. (2011) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2011.05.001 · Cited by 514
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
Ruszczyński, A., & Shapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10001-1 · Cited by 452
Baghalian, A., Rezapour, S., & Farahani, R. Z. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.12.017 · Cited by 434
Robust Truss Topology Design via Semidefinite Programming
Ben-Tal, A., & Nemirovski, A. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495291951 · Cited by 378
How Should Robustness Be Defined for Water Systems Planning under Change?
Herman, J. D., Reed, P. M., Zeff, H. B., & Characklis, G. W. (2015) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)wr.1943-5452.0000509 · Cited by 371
Marrying supply chain sustainability and resilience: A match made in heaven
Fahimnia, B., & Jabbarzadeh, A. (2016) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2016.02.007 · Cited by 358
Ben-Tal, A., Chung, B. D., Mandala, S. R., & Yao, T. (2011) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2010.09.002 · Cited by 341
A review of robust optimal design and its application in dynamics
Zang, C., Friswell, M. I., & Mottershead, J. E. (2005) · Computers & Structures · doi:10.1016/j.compstruc.2004.10.007 · Cited by 334
Lan, S., Clarke, J.-P., & Barnhart, C. (2006) · Transportation Science · doi:10.1287/trsc.1050.0134 · Cited by 314
A multi-objective stochastic programming approach for supply chain design considering risk
Azaron, A., Brown, K. N., Tarim, S. A., & Modarres, M. (2008) · International Journal of Production Economics · doi:10.1016/j.ijpe.2008.08.002 · Cited by 294
Kwakkel, J. H., Haasnoot, M., & Walker, W. E. (2015) · Climatic Change · doi:10.1007/s10584-014-1210-4 · Cited by 292
Stochastic network models for logistics planning in disaster relief
Alem, D., Clark, A., & Moreno, A. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.04.041 · Cited by 273
Quantitative models for supply chain planning under uncertainty: a review
Peidro, D., Mula, J., Poler, R., & Lario, F.-C. (2009) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-008-1715-y · Cited by 270
Kwakkel, J. H., Haasnoot, M., & Walker, W. E. (2016) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2016.09.017 · Cited by 261
“optimization, the uncertainty that exists about the outcomes of interest is described through a set of computational experiments (Mulvey et al., 1995), and robustness is defined over this set of experiments.”
BackgroundRobust supply chain design under uncertain demand in agile manufacturing
Pan, F., & Nagi, R. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2009.06.017 · Cited by 254
Flexible mobility on-demand: an environmental scan
Liyanage, S., Dia, H., Abduljabbar, R., & Bagloee, S. (2019) · Sustainability · doi:10.3390/su11051262 · Cited by 111
Two-stage fleet assignment model considering stochastic passenger demands
Sherali, H. D., & Zhu, X. (2008) · Operations Research · doi:10.1287/opre.1070.0476 · Cited by 56
“Furthermore, a robust optimization (RO) formulation (see Mulvey et al. 1995) can be constructed from Model 2.1 to stabilize the variability among the scenarios.”
BackgroundInfluential
Metadata
- Authors
- Mulvey, J. M., Vanderbei, R. J., & Zenios, S. A.
- Venue
- Operations Research
- Published
- 1995-04
- Volume
- 43
- Issue
- 2
- Pages
- 264-281
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2127331687
- Cited by
- 1,944
- References
- 23
- FWCI
- 26.45
- 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.