The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
Abstract
We review and develop different tractable approximations to individual chance-constrained problems in robust optimization on a variety of uncertainty sets and show their interesting connections with bounds on the conditional-value-at-risk (CVaR) measure. We extend the idea to joint chance-constrained problems and provide a new formulation that improves upon the standard approach. Our approach builds on a classical worst-case bound for order statistics problems and is applicable even if the constraints are correlated. We provide an application of the model on a network resource allocation problem with uncertain demand.
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
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
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
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
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
Prékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
Alizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
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
Stochastic Finance: An Introduction in Discrete Time
Föllmer, H., & Schied, A. (2002) · Cited by 1,210
Convex Approximations of Chance Constrained Programs
Nemirovski, A., & Shapiro, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050622328 · Cited by 1,160
The Scenario Approach to Robust Control Design
Calafiore, G. C., & Campi, M. C. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.875041 · Cited by 1,150
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
Stochastic Finance: An Introduction in Discrete Time
Föllmer, H., & Schied, A. (2004) · De Gruyter eBooks · doi:10.1515/9783110212075 · Cited by 701
A Sample Approximation Approach for Optimization with Probabilistic Constraints
Luedtke, J., & Ahmed, S. (2008) · SIAM Journal on Optimization · doi:10.1137/070702928 · Cited by 698
Stochastic Linear Programming: Models, Theory, and Computation
Kall, P., & Mayer, J. (2011) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-7729-8 · Cited by 667
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
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
On Distributionally Robust Chance-Constrained Linear Programs
Calafiore, G. C., & Ghaoui, L. E. (2006) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-006-9084-x · Cited by 508
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-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
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
Expected 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
Constructing Risk Measures from Uncertainty Sets
Natarajan, K., Pachamanova, D., & Sim, M. (2009) · Operations Research · doi:10.1287/opre.1080.0683 · Cited by 165
Self-citationROBUST SOLUTIONS TO UNCERTAIN PROGRAMS
Ben‐Tal, A., & Nemirovski, A. S. (1999) · Cited by 130
Chen, W., & Sim, M. (2009) · Operations Research · doi:10.1287/opre.1080.0570 · Cited by 107
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-citationStochastic Optimization for Unit Commitment—A Review
Zheng, Q. P., Wang, J., & Liu, A. L. (2015) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2355204 · Cited by 643
Data-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
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
Metadata
- Authors
- Chen, W., Sim, M., Sun, J., & Teo, C.-P.
- Venue
- Operations Research
- Published
- 2010-04
- Volume
- 58
- Issue
- 2
- Pages
- 470-485
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2096011304
- Cited by
- 318
- References
- 31
- FWCI
- 11.28
- 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.