The DOI matches its Crossref record.
Linear Programming under Uncertainty
Abstract
The essential character of the general models under consideration is that activities are divided into two or more stages. The quantities of activities in the first stage are the only ones that are required to be determined; those in the second (or later) stages can not be determined in advance since they depend on the earlier stages and the random or uncertain demands which occur on or before the latter stage. It is important to note that the set of activities are assumed to be complete in the sense that, whatever be the choice of activities in the earlier stages (consistent with the restrictions applicable to their stage), there is a possible choice of activities in the latter stages. In other words it is not possible to get in a position where the programming problem admits of no solution.
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
Cited by
A review on simulation-based optimization methods applied to building performance analysis
Nguyen, A.-T., Reiter, S., & Rigo, P. (2014) · Applied Energy · doi:10.1016/j.apenergy.2013.08.061 · Cited by 1,379
Monte Carlo bounding techniques for determining solution quality in stochastic programs
Mak, W.-K., Morton, D. P., & Wood, R. K. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(98)00054-6 · Cited by 704
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
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
Review of uncertainty-based multidisciplinary design optimization methods for aerospace vehicles
Yao, W., Chen, X., Luo, W., van Tooren, M., & Guo, J. (2011) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2011.05.001 · Cited by 514
Ruszczyński, A., & Shapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10001-1 · Cited by 452
A comprehensive review on uncertainty modeling techniques in power system studies
Aien, M., Hajebrahimi, A., & Fotuhi-Firuzabad, M. (2016) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2015.12.070 · Cited by 418
Ramezani, M., Bashiri, M., & Tavakkoli-Moghaddam, R. (2013) · Applied Mathematical Modelling · doi:10.1016/j.apm.2012.02.032 · Cited by 340
Chapter 3 Stochastic and dynamic networks and routing
Powell, W. B., Jaillet, P., & Odoni, A. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80107-0 · Cited by 334
A unified framework for stochastic optimization
Powell, W. B. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.014 · Cited by 314
On Complexity of Stochastic Programming Problems
Shapiro, A., & Nemirovski, A. (2006) · Applied Optimization · doi:10.1007/0-387-26771-9_4 · Cited by 301
Collins, S., Deane, J. P., Poncelet, K., Panos, E., Pietzcker, R. C., Delarue, E., & Ó Gallachóir, B. P. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2017.03.090 · Cited by 282
Marini, F., & Walczak, B. (2020) · Comprehensive Chemometrics · doi:10.1016/b978-0-12-409547-2.14581-0 · Cited by 277
Zubo, R. H. A., Mokryani, G., Rajamani, H.-S., Aghaei, J., Niknam, T., & Pillai, P. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2016.10.036 · Cited by 218
Theory and applications of robust optimization
Bertsimas, D., Brown, D. B., & Caramanis, C. (2011) · SIAM Review · doi:10.1137/080734510 · Cited by 134
Towards the fast and robust optimal design of wireless body area networks
D’Andreagiovanni, F., & Nardin, A. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.04.037 · Cited by 73
Eren, Y., Küçükdemiral, İ. B., & Üstoğlu, İ. (2017) · Optimization in Renewable Energy Systems · doi:10.1016/b978-0-08-101041-9.00002-8 · Cited by 67
Metadata
- Authors
- Dantzig, G. B.
- Venue
- Management Science
- Published
- 1955-04
- Volume
- 1
- Issue
- 3-4
- Pages
- 197-206
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W4251495539
- Cited by
- 1,225
- References
- 0
- FWCI
- 0.66
- 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.