Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Linear programming

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_545

Linear programming is one of the most widely used techniques of operations research and management science. Its name means that planning (programming) is being done with a mathematical model (called a linear programming model) where all the functions in the model are linear functions.


Linear programming models come in a variety of forms. To illustrate one common form, consider the problem of determining the most profitable mix of products for a manufacturer. Let n be the number of possible products. For each product j (j = 1, 2, ..., n), a decision variable xj is introduced to represent the decision on its production rate. Let cj be the profit per unit of product j produced, and let Z be the total rate of profit resulting from the choice of product mix. This choice is constrained by the limited capacities of the production facilities available for these products. Let m be the number of different types of facilities needed. For each type i (i = 1, 2, ..., m...
This is a preview of subscription content, log in to check access.


  1. [1]
    Dantzig, G.B. (1982). “Reminiscences about the origins of linear programming.” Opns. Res. Letters 1, 43–48.Google Scholar
  2. [2]
    Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University press, Princeton, New Jersey.Google Scholar
  3. [3]
    Dantzig, G.B. and Thapa, M.N. (1997). Linear Programming 1: Introduction. Springer-Verlag, New York.Google Scholar
  4. [4]
    Gass, S.I. (1990). An Illustrated Guide to Linear Programming. Dover, New York.Google Scholar
  5. [5]
    Hillier, F.S., Hillier, M.S., and Lieberman, G.J. (2000). Introduction to Management Science: A Modeling and Case Studies Approach with Spreadsheets. Irwin/McGraw-Hill, Burr Ridge, Illinois.Google Scholar
  6. [6]
    Hillier, F.S. and Lieberman, G.J. (2000). Introduction to Operations Research, 7th ed. McGraw-Hill, New York.Google Scholar
  7. [7]
    Klingman, D., Phillips, N., Steiger, D., Wirth, R., and Young, W. (1986). “The Challenges and Success Factors in Implementing an Integrated Products Planning System for Citgo.” Interfaces 16:3, 1–19.Google Scholar
  8. [8]
    Klingman, D., Phillips, N., Steiger, D., and Young, W. (1987). “The Successful Deployment of Management Science Throughout Citgo Petroleum Corporation.” Interfaces 17:1, 4–25.Google Scholar
  9. [9]
    Marsten, R., Subramanian, R., Saltzman, M., Lustig, I., and Shanno, D. (1990). “Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick!” Interfaces 20:4, 105–116.Google Scholar
  10. [10]
    Saigal, R. (1995). Linear Programming: An Integrated Analysis. Kluwer, Norwell, Massachusetts.Google Scholar
  11. [11]
    Schrijver, A. (1986). Theory of Linear and Integer Programming. John Wiley, New York. Google Scholar
  12. [12]
    Vanderbei, R.J. (1996). Linear Programming: Foundations and Extensions. Kluwer, Norwell, Massachusetts.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Stanford UniversityStanfordUSA