Abstract
The term integer programming is normally applied in the context of linear programming. An integer programming problem differs from the corresponding “normal” linear programming problem, by the additional condition that some (or all) variables must have integer values in any admissable solution.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Heesterman, A.R.G. (1983). Integer Programming and Some of its Applications. In: Matrices and Simplex Algorithms. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7941-3_19
Download citation
DOI: https://doi.org/10.1007/978-94-009-7941-3_19
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7943-7
Online ISBN: 978-94-009-7941-3
eBook Packages: Springer Book Archive