Linear Programming

  • H. A. Eiselt
  • Carl-Louis Sandblom
Part of the Springer Texts in Business and Economics book series (STBE)


This chapter will introduce linear programming, one of the most powerful tools in operations research. We first provide a short account of the history of the field, followed by a discussion of the main assumptions and some features of linear programming. Thus equipped, we then venture into some of the many applications that can be modeled with linear programming. This is followed by a discussion of the underlying graphical concepts and a discussion of the interpretation of the solution with many examples of sensitivity analyses. Each of the sections in this chapter is really a chapter in its own right. We have kept them under the umbrella of the chapter “Linear Programming” so as to emphasize that they belong together rather than being separate entities.


Objective Function Feasible Solution Extreme Point Police Officer Dual Problem 
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.


  1. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, PrincetonGoogle Scholar
  2. Dantzig GB, Thapa MN (1997) Linear programming: introduction. Springer, New YorkGoogle Scholar
  3. Eiselt HA, Sandblom C-L (2007) Linear programming and its applications. Springer, Berlin/Heidelberg/New YorkGoogle Scholar
  4. Garner Garille S, Gass SI (1981) Stigler’s diet problem revisited. Oper Res 49:1–13CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Faculty of Business AdministrationUniversity of New BrunswickFrederictonCanada
  2. 2.Deptartment of Industrial EngineeringDalhousie UniversityHalifaxCanada

Personalised recommendations