The DOI matches its Crossref record.
Linear Programming and Extensions
Abstract
A basic text in linear programming, the solution of systems of linear equalities. The subjects covered include the concepts, origins and formulations of linear programs, and the simplex method of solution as applied to the price concept, matrix games, and transportation problems.
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
Cited by
StringTie enables improved reconstruction of a transcriptome from RNA-seq reads
Pertea, M., Pertea, G. M., Antonescu, C. M., Chang, T.-C., Mendell, J. T., & Salzberg, S. L. (2015) · Nature Biotechnology · doi:10.1038/nbt.3122 · Cited by 14,298
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
The interdisciplinary study of coordination
Malone, T. W., & Crowston, K. (1994) · ACM Computing Surveys · doi:10.1145/174666.174668 · Cited by 3,504
Graph Implementations for Nonsmooth Convex Programs
Grant, M. C., & Boyd, S. P. (2007) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-1-84800-155-8_7 · Cited by 2,666
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
Soyster, A. L. (1973) · Operations Research · doi:10.1287/opre.21.5.1154 · Cited by 1,822
Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks
Katz, G., Barrett, C., Dill, D. L., Julian, K., & Kochenderfer, M. J. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63387-9_5 · Cited by 1,706
The assignment game I: The core
Shapley, L. S., & Shubik, M. (1971) · International Journal of Game Theory · doi:10.1007/bf01753437 · Cited by 1,682
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499350013 · Cited by 1,587
Mean-Absolute Deviation Portfolio Optimization Model and Its Applications to Tokyo Stock Market
Konno, H., & Yamazaki, H. (1991) · Management Science · doi:10.1287/mnsc.37.5.519 · Cited by 1,514
Predictive Control for Linear and Hybrid Systems
Borrelli, F., Bemporad, A., & Morari, M. (2017) · Cambridge University Press eBooks · doi:10.1017/9781139061759 · Cited by 1,443
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
Van Slyke, R. M., & Wets, R. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117061 · Cited by 1,281
qpOASES: a parametric active-set algorithm for quadratic programming
Ferreau, H. J., Kirches, C., Potschka, A., Bock, H. G., & Diehl, M. (2014) · Mathematical Programming Computation · doi:10.1007/s12532-014-0071-1 · Cited by 1,265
Engineering Optimization: Theory and Practice
Rao, S. S. (2009) · Wiley eBooks · doi:10.1002/9780470549124 · Cited by 1,254
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
A numerically stable dual method for solving strictly convex quadratic programs
Goldfarb, D., & Idnani, A. (1983) · Mathematical Programming · doi:10.1007/bf02591962 · Cited by 1,059
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Multiple Object Tracking Using K-Shortest Paths Optimization
Berclaz, J., Fleuret, F., Turetken, E., & Fua, P. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.21 · Cited by 1,015
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Combinatorial Auctions: A Survey
de Vries, S., & Vohra, R. V. (2003) · INFORMS Journal on Computing · doi:10.1287/ijoc.15.3.284.16077 · Cited by 985
Wagner, H. M. (1995) · Operations Research · doi:10.1287/opre.43.6.948 · Cited by 932
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Breast Cancer Diagnosis and Prognosis Via Linear Programming
Mangasarian, O. L., Street, W. N., & Wolberg, W. H. (1995) · Operations Research · doi:10.1287/opre.43.4.570 · Cited by 843
Robust Control in Power Systems
(2005) · Power Electronics and Power Systems · doi:10.1007/b136490 · Cited by 838
Le, F., Brandl, D. W., Urzhumov, Y. A., Wang, H., Kundu, J., Halas, N. J., Aizpurua, J., & Nordlander, P. (2008) · ACS Nano · doi:10.1021/nn800047e · Cited by 814
Simplify: a theorem prover for program checking
Detlefs, D., Nelson, G., & Saxe, J. B. (2005) · Journal of the ACM · doi:10.1145/1066100.1066102 · Cited by 786
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
Magnanti, T. L., & Wong, R. T. (1981) · Operations Research · doi:10.1287/opre.29.3.464 · Cited by 731
Computing the shortest path: A search meets graph theory
Goldberg, A. V., & Harrelson, C. (2005) · doi:10.5555/1070432.1070455 · Cited by 719
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Geisberger, R., Sanders, P., Schultes, D., & Delling, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68552-4_24 · Cited by 714
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1990) · ACM Transactions on Graphics · doi:10.1145/77635.77639 · Cited by 711
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
Suurballe, J. W. (1974) · Networks · doi:10.1002/net.3230040204 · Cited by 685
Smooth Pycnophylactic Interpolation for Geographical Regions
Tobler, W. R. (1979) · Journal of the American Statistical Association · doi:10.1080/01621459.1979.10481647 · Cited by 678
The computation of chemical equilibrium in complex systems containing non-ideal solutions
de Capitani, C., & Brown, T. H. (1987) · Geochimica et Cosmochimica Acta · doi:10.1016/0016-7037(87)90145-1 · Cited by 598
Biegler, L. T., & Grossmann, I. E. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.11.003 · Cited by 593
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Colmerauer, A. (1990) · Communications of the ACM · doi:10.1145/79204.79210 · Cited by 571
The Efficient Allocation of Individuals to Positions
Hylland, A., & Zeckhauser, R. (1979) · Journal of Political Economy · doi:10.1086/260757 · Cited by 549
Fishbone, L. G., & Abilock, H. (1981) · International Journal of Energy Research · doi:10.1002/er.4440050406 · Cited by 534
ETSAP-TIAM: the TIMES integrated assessment model Part I: Model structure
Loulou, R., & Labriet, M. (2008) · Computational Management Science · doi:10.1007/s10287-007-0046-z · Cited by 531
Large-scale linearly constrained optimization
Murtagh, B. A., & Saunders, M. A. (1978) · Mathematical Programming · doi:10.1007/bf01588950 · Cited by 527
A Linear Programming and Least Squares Computer Method for Solving Petrologic Mixing Problems
WRIGHT, T. L., & DOHERTY, P. C. (1970) · Geological Society of America Bulletin · doi:10.1130/0016-7606(1970)81[1995:alpals]2.0.co;2 · Cited by 481
Extension of GAMS for complementarity problems arising in applied economic analysis
Rutherford, T. F. (1995) · Journal of Economic Dynamics and Control · doi:10.1016/0165-1889(94)00831-2 · Cited by 476
The complexity of computing a Nash equilibrium
Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132527 · Cited by 470
Engineering Route Planning Algorithms
Delling, D., Sanders, P., Schultes, D., & Wagner, D. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02094-0_7 · Cited by 454
Balas, E., & Padberg, M. W. (1976) · SIAM Review · doi:10.1137/1018115 · Cited by 449
Genetic evolution of the topology and weight distribution of neural networks
Maniezzo, V. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265959 · Cited by 436
The empirical behavior of sampling methods for stochastic programming
Linderoth, J., Shapiro, A., & Wright, S. (2006) · Annals of Operations Research · doi:10.1007/s10479-006-6169-8 · Cited by 425
On the Complexity of Solving Markov Decision Problems
Littman, M. L., Dean, T., & Kaelbling, L. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4971 · Cited by 424
Auction algorithms for network flow problems: A tutorial introduction
Bertsekas, D. P. (1992) · Computational Optimization and Applications · doi:10.1007/bf00247653 · Cited by 421
Water-energy nexus: A review of methods and tools for macro-assessment
Dai, J., Wu, S., Han, G., Weinberg, J., Xie, X., Wu, X., Song, X., Jia, B., Xue, W., & Yang, Q. (2018) · Applied Energy · doi:10.1016/j.apenergy.2017.08.243 · Cited by 406
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
Smith, K. A. (1999) · INFORMS Journal on Computing · doi:10.1287/ijoc.11.1.15 · Cited by 401
Reluplex made more practical: Leaky ReLU
Xu, J., Li, Z., Du, B., Zhang, M., & Liu, J. (2020) · 2020 IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc50000.2020.9219587 · Cited by 398
Solving Real-World Linear Programs: A Decade and More of Progress
Bixby, R. E. (2002) · Operations Research · doi:10.1287/opre.50.1.3.17780 · Cited by 386
Markenscoff, X., Ni, L., & Papadimitriou, C. H. (1990) · The International Journal of Robotics Research · doi:10.1177/027836499000900102 · Cited by 385
Interior point methods 25 years later
Gondzio, J. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.09.017 · Cited by 377
On Implementing the Push—Relabel Method for the Maximum Flow Problem
Cherkassky, B. V., & Goldberg, A. V. (1997) · Algorithmica · doi:10.1007/pl00009180 · Cited by 370
Elicitation of Honest Preferences for the Assignment of Individuals to Positions
Leonard, H. B. (1983) · Journal of Political Economy · doi:10.1086/261158 · Cited by 352
Optimization Methods in Finance
Cornuejols, G., & Tütüncü, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511753886 · Cited by 347
Steiner's problem in graphs and its implications
Hakimi, S. L. (1971) · Networks · doi:10.1002/net.3230010203 · Cited by 347
Linear Assignment Problems and Extensions
Burkard, R. E., & Çela, E. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_2 · Cited by 330
Puchinger, J., & Raidl, G. R. (2005) · Lecture Notes in Computer Science · doi:10.1007/11499305_5 · Cited by 323
Global Stability in Many-Species Systems
Goh, B. S. (1977) · The American Naturalist · doi:10.1086/283144 · Cited by 316
The complexity of facets (and some facets of complexity)
Papadimitriou, C. H., & Yannakakis, M. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90068-0 · Cited by 307
Real-Time Convex Optimization in Signal Processing
Mattingley, J., & Boyd, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936020 · Cited by 300
A subexponential bound for linear programming
Matoušek, J., Sharir, M., & Welzl, E. (1996) · Algorithmica · doi:10.1007/bf01940877 · Cited by 300
Machine interpretation of line drawings
(1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(87)80119-6 · Cited by 298
Perceptual Metrics for Image Database Navigation
Rubner, Y., & Tomasi, C. (2001) · Springer eBooks · doi:10.1007/978-1-4757-3343-3 · Cited by 296
Observations of lattice curvature near the interface of a deformed aluminium bicrystal
Sun, S., Adams, B. L., & King, W. E. (2000) · Philosophical Magazine A · doi:10.1080/01418610008212038 · Cited by 284
Klein, M. (1967) · Management Science · doi:10.1287/mnsc.14.3.205 · Cited by 284
Model-Based Decision Support Methodology with Environmental Applications
(2000) · Springer eBooks · doi:10.1007/978-94-015-9552-0 · Cited by 284
Computational Geometry—A Survey
Lee, & Preparata (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676388 · Cited by 283
Hoping for A to Z While Rewarding Only A: Complex Organizations and Multiple Goals
Ethiraj, S. K., & Levinthal, D. (2009) · Organization Science · doi:10.1287/orsc.1080.0358 · Cited by 282
On the average number of steps of the simplex method of linear programming
Smale, S. (1983) · Mathematical Programming · doi:10.1007/bf02591902 · Cited by 279
Multi-robot coalition formation
Vig, L., & Adams, J. A. (2006) · IEEE Transactions on Robotics · doi:10.1109/tro.2006.878948 · Cited by 275
LEMON – an Open Source C++ Graph Template Library
Dezső, B., Jüttner, A., & Kovács, P. (2011) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2011.06.003 · Cited by 274
Suppression Methodology and Statistical Disclosure Control
Cox, L. H. (1980) · Journal of the American Statistical Association · doi:10.1080/01621459.1980.10477481 · Cited by 271
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Dial, R. B. (2006) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2006.02.008 · Cited by 259
Network Models for Building Evacuation
Chalmet, L. G., Francis, R. L., & Saunders, P. B. (1982) · Management Science · doi:10.1287/mnsc.28.1.86 · Cited by 256
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
Abraham, I., Delling, D., Goldberg, A. V., & Werneck, R. F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20662-7_20 · Cited by 254
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., & Wagner, D. (2010) · ACM Journal of Experimental Algorithmics · doi:10.1145/1671970.1671976 · Cited by 190
Singh, V., & Sharma, S. K. (2015) · European Transport Research Review · doi:10.1007/s12544-015-0160-x · Cited by 95
Optimal transport for single-cell and spatial omics
Bunne, C., Schiebinger, G., Krause, A., Regev, A., & Cuturi, M. (2024) · Nature Reviews Methods Primers · doi:10.1038/s43586-024-00334-2 · Cited by 71
Explanatory/Predictive Models of Hunter–Gatherer Adaptation
BETTINGER, R. L. (1980) · Advances in Archaeological Method and Theory · doi:10.1016/b978-0-12-003103-0.50010-1 · Cited by 51
Distributed Online Learning of Fog Computing Under Nonuniform Device Cardinality
Ren, C., Lyu, X., Ni, W., Tian, H., & Liu, R. P. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2867481 · Cited by 22
Time-dependent Decentralized Routing using Federated Learning
Wilbur, M., Samal, C., Talusan, J. P., Yasumoto, K., & Dubey, A. (2020) · 2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC) · doi:10.1109/isorc49007.2020.00018 · Cited by 8
PathGen-LLM: A Large Language Model for Dynamic Path Generation in Complex Transportation Networks
Li, X., Xian, K., Wen, H., Bai, S., Xu, H., & Yu, Y. (2025) · Mathematics · doi:10.3390/math13193073 · Cited by 4
Explanatory/Predictive Models of Hunter-Gatherer Adaptation
BETTINGER, R. L. (1981) · Advances in Archaeological Method and Theory · doi:10.1016/b978-0-12-624180-8.50009-3 · Cited by 2
Metadata
- Authors
- Dantzig, G.
- Venue
- RAND Corporation eBooks
- Publisher
- RAND Corporation
- Published
- 1963
- DOI
- 10.7249/r366
- OpenAlex
- W2127470768
- Cited by
- 5,755
- References
- 0
- FWCI
- 33.62
- Type
- book
- 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.