The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Abstract
We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to single-stage optimization. However, this advantage often comes at a price: two-stage optimization is, in general, significantly harder than single-stage optimization. For network flow and design under demand uncertainty, we give a characterization of the first-stage robust decisions with an exponential number of constraints and prove that the corresponding separation problem is 𝒩𝒫-hard even for a network flow problem on a bipartite graph. We show, however, that if the second-stage network topology is totally ordered or an arborescence, then the separation problem is tractable. Unlike single-stage robust optimization under demand uncertainty, two-stage robust optimization allows one to control conservatism of the solutions by means of an allowed “budget for demand uncertainty.” Using a budget of uncertainty, we provide an upper bound on the probability of infeasibility of a robust solution for a random demand vector. We generalize the approach to multicommodity network flow and design, and give applications to lot-sizing and location-transportation problems. By projecting out second-stage flow variables, we define an upper bounding problem for the two-stage min-max-min optimization problem. Finally, we present computational results comparing the proposed two-stage robust optimization approach with single-stage robust optimization as well as scenario-based two-stage stochastic optimization.
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
(1979) · Cited by 43,841
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
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Soyster, A. L. (1973) · Operations Research · doi:10.1287/opre.21.5.1154 · Cited by 1,822
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 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
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 Discrete Optimization and Its Applications
Kouvelis, P., & Yu, G. (1997) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-2620-6 · Cited by 1,169
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
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
Robust Portfolio Selection Problems
Goldfarb, D., & Iyengar, G. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.1.1.14260 · Cited by 895
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
Ambiguous chance constrained problems and robust optimization
Erdoğan, E., & Iyengar, G. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0678-0 · Cited by 302
Tractable Approximations to Robust Conic Optimization Problems
Bertsimas, D., & Sim, M. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0677-1 · Cited by 297
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
Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
Hoffman, A. J. (1960) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/010/0114759 · Cited by 192
Relative Entropy, Exponential Utility, and Robust Dynamic Pricing
Lim, A. E. B., & Shanthikumar, J. G. (2007) · Operations Research · doi:10.1287/opre.1070.0385 · Cited by 173
On the complexity of a class of combinatorial optimization problems with uncertainty
Averbakh, I. (2001) · Mathematical Programming · doi:10.1007/pl00011424 · Cited by 162
Computing robust basestock levels
Bienstock, D., & Özbay, N. (2007) · Discrete Optimization · doi:10.1016/j.disopt.2006.12.002 · Cited by 155
Strong Formulations of Robust Mixed 0–1 Programming
Atamtürk, A. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0709-5 · Cited by 85
Self-citation
Cited by
Robust Unit Commitment With Wind Power and Pumped Storage Hydro
Jiang, R., Wang, J., & Guan, Y. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2169817 · Cited by 941
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
Ning, C., & You, F. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.03.034 · Cited by 343
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
Robust and Data-Driven Optimization: Modern Decision Making Under Uncertainty
Bertsimas, D., & Thiele, A. (2006) · Models, Methods, and Applications for Innovative Decision Making · doi:10.1287/educ.1063.0022 · Cited by 280
Metadata
- Authors
- Atamtürk, A., & Zhang, M.
- Venue
- Operations Research
- Published
- 2007-08
- Volume
- 55
- Issue
- 4
- Pages
- 662-673
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2092506216
- Cited by
- 340
- References
- 22
- FWCI
- 23.84
- 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.