The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
A Robust Optimization Perspective on Stochastic Programming
Abstract
In this paper, we introduce an approach for constructing uncertainty sets for robust optimization using new deviation measures for random variables termed the forward and backward deviations. These deviation measures capture distributional asymmetry and lead to better approximations of chance constraints. Using a linear decision rule, we also propose a tractable approximation approach for solving a class of multistage chance-constrained stochastic linear optimization problems. An attractive feature of the framework is that we convert the original model into a second-order cone program, which is computationally tractable both in theory and in practice. We demonstrate the framework through an application of a project management problem with uncertain activity completion time.
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
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-citationChance-Constrained Programming
Charnes, A., & Cooper, W. W. (1959) · Management Science · doi:10.1287/mnsc.6.1.73 · Cited by 2,742
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
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 discrete optimization and network flows
Bertsimas, D., & Sim, M. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0396-4 · Cited by 1,799
Self-citationRobust 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
Prékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
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
Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
Charnes, A., & Cooper, W. W. (1963) · Operations Research · doi:10.1287/opre.11.1.18 · Cited by 992
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
A Robust Optimization Approach to Inventory Theory
Bertsimas, D., & Thiele, A. (2006) · Operations Research · doi:10.1287/opre.1050.0238 · Cited by 705
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
Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil
Charnes, A., Cooper, W. W., & Symonds, G. H. (1958) · Management Science · doi:10.1287/mnsc.4.3.235 · Cited by 623
Robust linear optimization under general norms
Bertsimas, D., Pachamanova, D., & Sim, M. (2004) · Operations Research Letters · doi:10.1016/j.orl.2003.12.007 · Cited by 481
Self-citationOn Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
de Farias, D. P., & Van Roy, B. (2004) · Mathematics of Operations Research · doi:10.1287/moor.1040.0094 · Cited by 373
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach
Ben-Tal, A., Golany, B., Nemirovski, A., & Vial, J.-P. (2005) · Manufacturing & Service Operations Management · doi:10.1287/msom.1050.0081 · Cited by 322
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
On Complexity of Stochastic Programming Problems
Shapiro, A., & Nemirovski, A. (2006) · Applied Optimization · doi:10.1007/0-387-26771-9_4 · Cited by 301
Tractable Approximations to Robust Conic Optimization Problems
Bertsimas, D., & Sim, M. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0677-1 · Cited by 297
Self-citationA 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-citationComputational complexity of PERT problems
Hagstrom, J. N. (1988) · Networks · doi:10.1002/net.3230180206 · Cited by 169
ROBUST SOLUTIONS TO LEAST-SQUARE PROBLEMS TO UNCERTAIN DATA MATRICES
Ghaoui, L. E., & Lebret, H. (1997) · Cited by 143
ROBUST SOLUTIONS TO UNCERTAIN PROGRAMS
Ben‐Tal, A., & Nemirovski, A. S. (1999) · Cited by 130
Strong Formulations of Robust Mixed 0–1 Programming
Atamtürk, A. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0709-5 · Cited by 85
Supplier-Retailer Flexible Commitments Contracts : A Robust Optimization Approach
Ben‐Tal, A., Golany, B., Nemirovski, A., & Vial, J.-P. (2003) · Archive ouverte UNIGE (University of Geneva) · Cited by 38
Cited by
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
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
Distributionally Robust Optimization and Its Tractable Approximations
Goh, J., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0795 · Cited by 668
Self-citationData-driven robust optimization
Bertsimas, D., Gupta, V., & Kallus, N. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1125-8 · Cited by 611
Infrastructure planning for electric vehicles with battery swapping
Mak, H.-Y., Rong, Y., & Shen, Z.-J. M. (2013) · Management Science · doi:10.1287/mnsc.1120.1672 · Cited by 570
Metadata
- Authors
- Chen, X., Sim, M., & Sun, P.
- Venue
- Operations Research
- Published
- 2007-12
- Volume
- 55
- Issue
- 6
- Pages
- 1058-1071
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2103201064
- Cited by
- 362
- References
- 30
- FWCI
- 19.55
- 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.