The DOI matches its Crossref record.
A brief history of linear and mixed-integer programming computation
Abstract
For many of us, modern-day linear programming (LP) started with the work of George Dantzig in 1947. However, it must be said that many other scientists have also made seminal contributions to the subject, and some would argue that the origins of LP predate Dantzig’s contribution. It is matter open to debate [36]. However, what is not open to debate is Dantzig’s key contribution to LP computation. In contrast to the economists of his time, Dantzig viewed LP not just as a qualitative tool in the analysis of economic phenomena, but as a method that could be used to compute actual answers to specific real-world problems. Consistent with that view, he proposed an algorithm for solving LPs, the simplex algorithm [12]. To this day the simplex algorithm remains a primary computational tool in linear and mixed-integer programming (MIP). In [11] it is reported that the first application of Dantzig’s simplex algorithm to the solution of a non-trivial LP was Laderman’s solution of a 21 constraint, 77 variable instance of the classical Stigler Diet Problem [41]. It is reported that the total computation time was 120 man-days! The first computer implementation of an at-least modestly general version of the simplex algorithm is reported to have been on the SEAC computer at the then National Bureau of Standards [25]. (There were apparently some slightly earlier implementations for dealing with models that were “triangular”, that is, where all the linear systems could be solved by simple addition and subtraction.) Orchard-Hays [35] reports that several small instances having as many as 10 constraints and 20 variables were solved with this implementation. The first systematic development of computer codes for the simplex algo-rithm began very shortly thereafter at the RAND Corporation in Santa Mon-ica, California. Dantzig’s initial LP work occurred at the Air Force following
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
Best subset selection via a modern optimization lens
Bertsimas, D., King, A., & Mazumder, R. (2016) · The Annals of Statistics · doi:10.1214/15-aos1388 · Cited by 655
Bertsimas, D., & Dunn, J. (2017) · Machine Learning · doi:10.1007/s10994-017-5633-9 · Cited by 638
Pisinger, D., & Ropke, S. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_4 · Cited by 395
Output Range Analysis for Deep Feedforward Neural Networks
Dutta, S., Jha, S., Sankaranarayanan, S., & Tiwari, A. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-77935-5_9 · Cited by 289
Nonnegative/Binary matrix factorization with a D-Wave quantum annealer
O’Malley, D., Vesselinov, V. V., Alexandrov, B. S., & Alexandrov, L. B. (2018) · PLOS ONE · doi:10.1371/journal.pone.0206653 · Cited by 140
Measuring the Algorithmic Efficiency of Neural Networks
Hernandez, D., & Brown, T. B. (2020) · arXiv · doi:10.48550/arxiv.2005.04305 · Cited by 89
Algorithmic progress in language models
Ho, A., Besiroglu, T., Erdil, E., Owen, D., Rahman, R., Guo, Z. C., Atkinson, D., Thompson, N., & Sevilla, J. (2024) · arXiv · doi:10.48550/arxiv.2403.05812 · Cited by 16
Metadata
- Authors
- Bixby, R. E.
- Venue
- Documenta Mathematica Series
- Publisher
- EMS Press
- Published
- 2012-01-01
- Pages
- 107-121
- ISSN
- 2943-498X (ISSN-L)
- 2943-4998
- OpenAlex
- W2311812978
- Cited by
- 228
- References
- 0
- FWCI
- 11.70
- Type
- book chapter
- 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.