Abstract
One of the areas of mathematics which has extensive use in combinatorial optimization is called linear programming (LP). It derives its name from the fact that the LP problem is an optimization problem in which the objective function and all the constraints are linear. Many real-world problems can be formulated in this way. Even more problems can be effectively approximated by an LP model. Also an LP solution method can be used as a subroutine in solving integer-programming problems (as indicated in Section 2.1) and certain nonlinear optimization problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Further Reading
Dantzig, G. B. Linear Programming and Extensions. Princeton, N.J.: Princeton Univ. Press, 1963.
Daellenbach, H. G., and Bell, E.J. Users Guide to Linear Programming. Englewood Cliffs, N.J.: Prentice-Hall, 1970
Bazaraa, M. S., and Jarvis, J.J. Linear Programming and Network Flows. New York, Wiley, 1971.
Gass, S.I. Linear Programming. 4th ed. New York: McGraw-Hill, 1975.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Foulds, L.R. (1984). Linear Programming and Extensions. In: Combinatorial Optimization for Undergraduates. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9511-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9511-9_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9513-3
Online ISBN: 978-1-4613-9511-9
eBook Packages: Springer Book Archive