The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Management Models and Industrial Applications of Linear Programming
Abstract
An accelerating increase in linear programming applications to industrial problems has made it virtually impossible to keep abreast of them, not only because of their number (and diversity) but also because of the conditions under which many are carried out. Industrial (and governmental) secrecy is often present. Other conditions also bar access to ascertainment and assessment of the pattern of applications. Lack of a tradition for publication is one. Failure to ascertain the general significance of particular findings is another, as is discouragement arising from the fact that similar applications have previously been published by others. Immediate remedies are not available for these difficulties. Presumably conventions such as this will help, over a period of time, by encouraging informal contacts between interested persons. A talk on “industrial applications of linear programming” must be altered to suit these circumstances. In place of a survey or evaluation of industrial studies, two broad issues which are relevant to all such applications will be discussed. These are, (1) use of linear programming models as guides to data collection and (2) analysis (and prognosis) of fruitful areas of additional research, especially those which appear to have been opened by industrial applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Nash, J. (1989) · Cournot Oligopoly · doi:10.1017/cbo9780511528231.007 · Cited by 5,595
An algorithm for quadratic programming
Frank, M., & Wolfe, P. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030109 · Cited by 3,030
The Distribution of a Product from Several Sources to Numerous Localities
Hitchcock, F. L. (1941) · Journal of Mathematics and Physics · doi:10.1002/sapm1941201224 · Cited by 1,609
Linear Programming Under Uncertainty
Dantzig, G. B. (2004) · Management Science · doi:10.1287/mnsc.1040.0261 · Cited by 1,173
The Structure of American Economy, 1919-1939.
Barna, T., & Leontief, W. W. (1954) · Economica · doi:10.2307/2550364 · Cited by 812
On Minimizing a Convex Function Subject to Linear Inequalities
Beale, E. M. L. (1955) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1955.tb00191.x · Cited by 625
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-citationThe optimization of a quadratic function subject to linear constraints
Markowitz, H. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030110 · Cited by 537
The computational algorithm for the parametric objective function
Gass, S., & Saaty, T. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020106 · Cited by 507
Stigler, G. J. (1945) · Journal of Farm Economics · doi:10.2307/1231810 · Cited by 490
A Linear Decision Rule for Production and Employment Scheduling
Holt, C. C., Modigliani, F., & Simon, H. A. (1955) · Management Science · doi:10.1287/mnsc.2.1.1 · Cited by 392
Optimality and Degeneracy in Linear Programming
Charnes, A. (1952) · Econometrica · doi:10.2307/1907845 · Cited by 276
Self-citationAn Introduction to Linear Programming
O., D. G., Charnes, A., Cooper, W. W., & Henderson, A. (1953) · OR · doi:10.2307/3006832 · Cited by 241
Self-citationCharnes, A., Cooper, W. W., & Mellon, B. (1952) · Econometrica · doi:10.2307/1907844 · Cited by 124
Self-citationSub-Optimization in Operations Problems
Hitch, C. J. (1953) · Journal of the Operations Research Society of America · doi:10.1287/opre.1.3.87 · Cited by 88
The structure of dynamic programing models
Karlin, S. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020408 · Cited by 62
The Problem of Classification of Personnel
Thorndike, R. L. (1950) · Psychometrika · doi:10.1007/bf02289039 · Cited by 58
Cited by
Measuring the efficiency of decision making units
Charnes, A., Cooper, W. W., & Rhodes, E. (1978) · European Journal of Operational Research · doi:10.1016/0377-2217(78)90138-8 · Cited by 29,767
Self-citationSurvey of multi-objective optimization methods for engineering
Marler, R. T., & Arora, J. S. (2004) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-003-0368-6 · Cited by 4,710
Multiple Criteria Decision Analysis: State of the Art Surveys
Figueira, J., Greco, S., & Ehrogott, M. (2005) · International Series in Operations Research & Management Science · doi:10.1007/b100605 · Cited by 4,491
Fuzzy programming and linear programming with several objective functions
Zimmermann, H.-J. (1978) · Fuzzy Sets and Systems · doi:10.1016/0165-0114(78)90031-3 · Cited by 3,605
A slacks-based measure of super-efficiency in data envelopment analysis
Tone, K. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00324-1 · Cited by 3,576
Metadata
- Authors
- Charnes, A., & Cooper, W. W.
- Venue
- Management Science
- Published
- 1957-10
- Volume
- 4
- Issue
- 1
- Pages
- 38-91
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2158550687
- Cited by
- 1,902
- References
- 18
- FWCI
- 7.36
- 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.