Scenarios and Policy Aggregation in Optimization Under Uncertainty
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
A common approach in coping with multiperiod optimization problems under uncertainty where statistical information is not really enough to support a stochastic programming model, has been to set up and analyze a number of scenarios. The aim then is to identify trends and essential features on which a robust decision policy can be based. This paper develops for the first time a rigorous algorithmic procedure for determining such a policy in response to any weighting of the scenarios. The scenarios are bundled at various levels to reflect the availability of information, and iterative adjustments are made to the decision policy to adapt to this structure and remove the dependence on hindsight.
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
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Monotone Operators and the Proximal Point Algorithm
Rockafellar, R. T. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314056 · Cited by 3,559
Self-citationA dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Rockafellar, R. T. (1976) · Mathematics of Operations Research · doi:10.1287/moor.1.2.97 · Cited by 1,175
Self-citationMonotone (nonlinear) operators in Hilbert space
Minty, G. J. (1962) · Duke Mathematical Journal · doi:10.1215/s0012-7094-62-02933-2 · Cited by 1,135
Partial inverse of a monotone operator
Spingarn, J. E. (1983) · Applied Mathematics & Optimization · doi:10.1007/bf01448388 · Cited by 185
Applications of the method of partial inverses to convex programming: Decomposition
Spingarn, J. E. (1985) · Mathematical Programming · doi:10.1007/bf01586091 · Cited by 151
Rockafellar, R. T., & Wets, R. J. ‐. (1990) · SIAM Journal on Control and Optimization · doi:10.1137/0328046 · Cited by 96
Self-citationEckstein, J., & Systems., D. (1988) · Cited by 9
Cited by
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
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
Stochastic Security-Constrained Unit Commitment
Wu, L., Shahidehpour, M., & Li, T. (2007) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2007.894843 · Cited by 847
Metadata
- Authors
- Rockafellar, R. T., & Wets, R. J.-B.
- Venue
- Mathematics of Operations Research
- Published
- 1991-02
- Volume
- 16
- Issue
- 1
- Pages
- 119-147
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W1969007958
- Cited by
- 1,340
- References
- 10
- FWCI
- 37.85
- 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.