Linear Programming and Extensions

  • L. R. Foulds
Part of the Undergraduate Texts in Mathematics book series (UTM)


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.


Feasible Solution Simplex Method Transportation Problem Empty Cell Slack Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Further Reading

  1. Dantzig, G. B. Linear Programming and Extensions. Princeton, N.J.: Princeton Univ. Press, 1963.MATHGoogle Scholar
  2. Daellenbach, H. G., and Bell, E.J. Users Guide to Linear Programming. Englewood Cliffs, N.J.: Prentice-Hall, 1970Google Scholar
  3. Bazaraa, M. S., and Jarvis, J.J. Linear Programming and Network Flows. New York, Wiley, 1971.Google Scholar
  4. Gass, S.I. Linear Programming. 4th ed. New York: McGraw-Hill, 1975.MATHGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1984

Authors and Affiliations

  • L. R. Foulds
    • 1
  1. 1.Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations