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 via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
Balas, E. 1965. An additive algorithm for solving linear programs with zero–one variables. Operations Research 13: 517–546.
Benders, J.F. 1962. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4: 238–252.
Gomory, R.E. 1958. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64: 275–278.
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.
Land, A.H., and A.G. Doig. 1960. An automatic method for solving discrete programming problems. Econometrica 28: 497–520.
Author information
Authors and Affiliations
Editor information
Copyright information
© 2018 Macmillan Publishers Ltd.
About this entry
Cite this entry
Balas, E. (2018). Integer Programming. In: The New Palgrave Dictionary of Economics. Palgrave Macmillan, London. https://doi.org/10.1057/978-1-349-95189-5_881
Download citation
DOI: https://doi.org/10.1057/978-1-349-95189-5_881
Published:
Publisher Name: Palgrave Macmillan, London
Print ISBN: 978-1-349-95188-8
Online ISBN: 978-1-349-95189-5
eBook Packages: Economics and FinanceReference Module Humanities and Social SciencesReference Module Business, Economics and Social Sciences