The New Palgrave Dictionary of Economics

2018 Edition
| Editors: Macmillan Publishers Ltd

Integer Programming

  • Egon Balas
Reference work entry
DOI: https://doi.org/10.1057/978-1-349-95189-5_881

Abstract

Integer programming is the youngest branch of mathematical programming: its development started in the late 1950s. A (linear or nonlinear) integer program is a linear or nonlinear program whose variables are constrained to be integer. We will consider here only the linear case, although there exist extensions of the techniques to be discussed to nonlinear integer programming.

This is a preview of subscription content, log in to check access

Bibliography

  1. Balas, E. 1965. An additive algorithm for solving linear programs with zero–one variables. Operations Research 13: 517–546.CrossRefGoogle Scholar
  2. Benders, J.F. 1962. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4: 238–252.CrossRefGoogle Scholar
  3. Gomory, R.E. 1958. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64: 275–278.CrossRefGoogle Scholar
  4. Hoffman, A.J., and J.B. Kruskal. 1958. Integral boundary points of convex polyhedra. In Linear inequalities and related systems, ed. H.W. Kuhn and A.W. Tucker, 223–246. Princeton: Princeton University Press.Google Scholar
  5. Land, A.H., and A.G. Doig. 1960. An automatic method for solving discrete programming problems. Econometrica 28: 497–520.CrossRefGoogle Scholar

Copyright information

© Macmillan Publishers Ltd. 2018

Authors and Affiliations

  • Egon Balas
    • 1
  1. 1.