Abstract
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.
Change history
11 January 2018
The original version of the book was inadvertently published without updating the following corrections:
References
Dantzig, G. B. (1953). Computational algorithm of the revised simplex method. RAND Report RM-1266, The RAND Corporation, Santa Monica, CA.
Lemke, C. E. (1954). The dual method of solving the linear programming problem. Naval Research Logistics Quarterly, 1(1), 36ā47.
MathWorks. (2017). MuPAD: userās guide. Available online at: http://cn.mathworks.com/help/pdf_doc/symbolic/mupad_ug.pdf (Last access on March 31, 2017).
Mehrotra, S. (1992). On the implementation of a primal-dual interior point method. SIAM Journal on Optimization, 2, 575ā601.
Paparrizos, K. (1991). An infeasible exterior point simplex algorithm for assignment problems. Mathematical Programming, 51(1ā3), 45ā54.
Paparrizos, K. (1993). An exterior point simplex algorithm for (general) linear programming problems. Annals of Operations Research, 47, 497ā508.
Author information
Authors and Affiliations
2.1 Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
Copyright information
Ā© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Ploskas, N., Samaras, N. (2017). Linear Programming Algorithms. In: Linear Programming Using MATLABĀ® . Springer Optimization and Its Applications, vol 127. Springer, Cham. https://doi.org/10.1007/978-3-319-65919-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-65919-0_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65917-6
Online ISBN: 978-3-319-65919-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)