The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
Abstract
Chance constrained programming admits random data variations and permits constraint violations up to specified probability limits. Different kinds of decision rules and optimizing objectives may be used so that, under certain conditions, a programming problem (not necessarily linear) can be achieved that is deterministic—in that all random elements have been eliminated. Existence of such “deterministic equivalents” in the form of specified convex programming problems is here established for a general class of linear decision rules under the following 3 classes of objectives (1) maximum expected value (“E model”), (2) minimum variance (“V model”), and (3) maximum probability (“P model”). Various explanations and interpretations of these results are supplied along with other aspects of chance constrained programming. For example, the “P model” is interpreted so that H. A. Simon's suggestions for “satisficing” can be studied relative to more traditional optimizing objectives associated with “E” and “V model” variants.
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
Portfolio Selection: Efficient Diversification of Investments
Stuart, A., & Markowitz, H. M. (1959) · OR · doi:10.2307/3006625 · Cited by 5,534
Shackle, G. L. S., & Simon, H. A. (1959) · The Economic Journal · doi:10.2307/2228083 · Cited by 3,558
Programming with linear fractional functionals
Charnes, A., & Cooper, W. W. (1962) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800090303 · Cited by 2,936
Self-citationChance-Constrained Programming
Charnes, A., & Cooper, W. W. (1959) · Management Science · doi:10.1287/mnsc.6.1.73 · Cited by 2,742
Self-citationManagement Models and Industrial Applications of Linear Programming
Charnes, A., & Cooper, W. W. (1957) · Management Science · doi:10.1287/mnsc.4.1.38 · Cited by 1,902
Self-citationLinear Programming Under Uncertainty
Dantzig, G. B. (2004) · Management Science · doi:10.1287/mnsc.1040.0261 · Cited by 1,173
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
Self-citationBudget Control and Cost Behavior
Stedry, A. C. (2017) · Medical Entomology and Zoology · Cited by 239
Chance Constraints and Normal Deviates
Charnes, A., & Cooper, W. W. (1962) · Journal of the American Statistical Association · doi:10.1080/01621459.1962.10482155 · Cited by 209
Self-citationSystems Evaluation and Repricing Theorems
Charnes, A., & Cooper, W. W. (1962) · Management Science · doi:10.1287/mnsc.9.1.33 · Cited by 48
Self-citation
Cited by
BOUNDED RATIONALITY, AMBIGUITY, AND THE ENGINEERING OF CHOICE
March, J. G. (1988) · Decision Making · doi:10.1017/cbo9780511598951.004 · Cited by 1,688
Stochastic Model Predictive Control: An Overview and Perspectives for Future Research
(2016) · IEEE Control Systems · doi:10.1109/mcs.2016.2602087 · Cited by 923
Theory and Practice of Uncertain Programming
Liu, B. (2009) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-89484-1 · Cited by 694
A review of optimization techniques in metal cutting processes
Mukherjee, I., & Ray, P. K. (2006) · Computers & Industrial Engineering · doi:10.1016/j.cie.2005.10.001 · Cited by 549
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
Metadata
- Authors
- Charnes, A., & Cooper, W. W.
- Venue
- Operations Research
- Published
- 1963-02
- Volume
- 11
- Issue
- 1
- Pages
- 18-39
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W1987420866
- Cited by
- 992
- References
- 10
- FWCI
- 10.44
- 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.