Robust optimization ? methodology and applications
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The bounded uncertainty and its associated worst-case action selection may lead to too conservative solution.
“The bounded uncertainty and its associated worst-case action selection may lead to too conservative solution (see Chapter 2 of [29]).”
From Chance constrained day-ahead robust flexibility needs assessment for low voltage distribution network (2022) · cites this paper as [29]
Robust optimization is a two-stage optimization problem where the inner level minimizes the objective function and the outer level maximizes the inner-optimization within an uncertainty set.
“Robust optimization is a two-stage optimization problem where the inner level minimizes the objective function and the outer level maximizes the inner-optimization within an uncertainty set [22]-[24], [29].”
From Chance constrained day-ahead robust flexibility needs assessment for low voltage distribution network (2022) · cites this paper as [29]
Cited by
Sorted by citations
Optimal Multiperiod Pricing with Service Guarantees
Borgs, C., Candogan, O., Chayes, J., Lobel, I., & Nazerzadeh, H. (2014) · Management Science · doi:10.1287/mnsc.2013.1839 · Cited by 60 · see citing works
Prescriptive analytics for human resource planning in the professional services industry
Berk, L., Bertsimas, D., Weinstein, A. M., & Yan, J. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.06.035 · Cited by 59 · see citing works
Hu, Z., Guo, N., Qiu, R., Bonior, J., Liou, L., Lin, D., Longbrake, M., Buxa, P., Dalrymple, T., Hary, S., et al. (2010) · Proceedings of the IEEE 2010 National Aerospace & Electronics Conference · doi:10.1109/naecon.2010.5712925 · Cited by 5 · see citing works
Hashmi, M. U., Koirala, A., Ergun, H., & Van Hertem, D. (2022) · arXiv · doi:10.48550/arxiv.2207.10234 · Cited by 1 · see citing works
- Authors
- Ben-Tal, A., & Nemirovski, A.
- Affiliations
- Technion – Israel Institute of Technology (IL)
- ORCID
- Nemirovski, Arkadi
- Venue
- Mathematical Programming
- Published
- 2002-05-01
- Volume
- 92
- Issue
- 3
- Pages
- 453-480
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2006093909
- Cited by
- 1,409
- References
- 0
- Citations by year
- 2026: 61 · 2025: 62 · 2024: 66 · 2023: 77 · 2022: 76 · 2021: 60 · 2020: 71 · 2019: 83 · 2018: 79 · 2017: 100 · 2016: 67 · 2015: 64 · 2014: 81 · 2013: 81 · 2012: 73
- FWCI
- 12.62
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Mathematical Programming (publishedVersion)
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Risk and Portfolio Optimization
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Engineering › Control and Systems Engineering › Stability and Control of Uncertain Systems
- Keywords
- robust optimization, uncertainty sets, robust counterpart, semidefinite programming, antenna design, stability analysis, uncertain dynamical systems, data perturbation, feasibility
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
