Linear Programming Algorithms

Part of the Springer Optimization and Its Applications book series (SOIA, volume 127)


LPs can be formulated in various forms. An LP problem consists of the objective function, the constraints, and the decision variables. This chapter presents the theoretical background of LP. More specifically, the different formulations of the LP problem are presented. Detailed steps on how to formulate an LP problem are given. In addition, the geometry of the feasible region and the duality principle are also covered. Finally, a brief description of LP algorithms that will be used in this book is also presented.

Supplementary material (14 kb)
Chapter 2 (Zip 15 kb)


  1. 1.
    Dantzig, G. B. (1953). Computational algorithm of the revised simplex method. RAND Report RM-1266, The RAND Corporation, Santa Monica, CA.Google Scholar
  2. 2.
    Lemke, C. E. (1954). The dual method of solving the linear programming problem. Naval Research Logistics Quarterly, 1(1), 36–47.MathSciNetCrossRefGoogle Scholar
  3. 3.
    MathWorks. (2017). MuPAD: user’s guide. Available online at: (Last access on March 31, 2017).
  4. 4.
    Mehrotra, S. (1992). On the implementation of a primal-dual interior point method. SIAM Journal on Optimization, 2, 575–601.MathSciNetCrossRefGoogle Scholar
  5. 5.
    Paparrizos, K. (1991). An infeasible exterior point simplex algorithm for assignment problems. Mathematical Programming, 51(1–3), 45–54.MathSciNetCrossRefGoogle Scholar
  6. 6.
    Paparrizos, K. (1993). An exterior point simplex algorithm for (general) linear programming problems. Annals of Operations Research, 47, 497–508.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Applied InformaticsUniversity of MacedoniaThessalonikiGreece

Personalised recommendations