The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Ambiguous chance constrained problems and robust optimization
Open accessOverview
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Artzner, P., Delbaen, F., Eber, J., & Heath, D. (1999) · Mathematical Finance · doi:10.1111/1467-9965.00068 · Cited by 8,806
Maxmin 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
Chance-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
Stochastic Programming: The State of the Art In Honor of George B. Dantzig
(2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1642-6 · Cited by 2,239
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
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
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Convex measures of risk and trading constraints
Föllmer, H., & Schied, A. (2002) · Finance and Stochastics · doi:10.1007/s007800200072 · Cited by 1,447
Robust Control and Model Uncertainty
Hansen, L. P., & Sargent, T. J. (2001) · American Economic Review · doi:10.1257/aer.91.2.60 · Cited by 1,344
The Existence of Probability Measures with Given Marginals
Strassen, V. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700153 · Cited by 1,301
On Choosing and Bounding Probability Metrics
Gibbs, A. L., & Su, F. E. (2002) · International Statistical Review · doi:10.1111/j.1751-5823.2002.tb00178.x · Cited by 1,163
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
Ambiguity, Risk, and Asset Returns in Continuous Time
Chen, Z., & Epstein, L. (2002) · Econometrica · doi:10.1111/1468-0262.00337 · Cited by 1,072
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
Self-citationEpstein, L. G., & Schneider, M. (2003) · Journal of Economic Theory · doi:10.1016/s0022-0531(03)00097-8 · Cited by 865
Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications
Ben-Tal, A., & Nemirovski, A. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718829 · Cited by 747
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
Robust solution to least squares problems with uncertain data
Ghaoui, L. E., & Lebret, H. (1997) · Cited by 638
Iyengar, G. N. (2005) · Mathematics of Operations Research · doi:10.1287/moor.1040.0129 · Cited by 566
Self-citationRuszczyński, A., & Shapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10001-1 · Cited by 452
Robust Truss Topology Design via Semidefinite Programming
Ben-Tal, A., & Nemirovski, A. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495291951 · Cited by 378
On 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
Distances of Probability Measures and Random Variables
Dudley, R. M. (2010) · Springer eBooks · doi:10.1007/978-1-4419-5821-1_4 · Cited by 284
Probability Metrics and the Stability of Stochastic Models
Freeman, J. (1992) · Journal of the Operational Research Society · doi:10.1057/jors.1992.135 · Cited by 188
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
The complexity of learning according to two models of a drifting environment
Long, P. M. (1998) · Conference on Learning Theory · doi:10.1145/279943.279968 · Cited by 34
Cited by
Convex Approximations of Chance Constrained Programs
Nemirovski, A., & Shapiro, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050622328 · Cited by 1,160
Distributionally Robust Stochastic Optimization with Wasserstein Distance
Gao, R., & Kleywegt, A. (2023) · Mathematics of Operations Research · doi:10.1287/moor.2022.1275 · Cited by 630
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Campi, M. C., & Garatti, S. (2008) · SIAM Journal on Optimization · doi:10.1137/07069821x · Cited by 560
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
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
Bienstock, D., Chertkov, M., & Harnett, S. (2014) · SIAM Review · doi:10.1137/130910312 · Cited by 496
Metadata
- Authors
- Erdoğan, E., & Iyengar, G.
- Venue
- Mathematical Programming
- Published
- 2005-12-30
- Volume
- 107
- Issue
- 1-2
- Pages
- 37-61
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2006041100
- Cited by
- 302
- References
- 30
- FWCI
- 12.56
- Type
- journal article
- Language
- en
- Open access
- green
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.