The Linear Programming (LP) problem is perhaps the most important and well-studied optimization problem. Numerous real world problems can be formulated as Linear Programming problems (LPs). LP algorithms have been used in many fields ranging from airline scheduling to logistics, transportation, decision making, and data mining. This chapter introduces some key features of LP and presents a brief history of LP algorithms. Finally, the reasons of the novelty of this book and its organization are also presented.
- 5.Dongarra, J., & Sullivan, F. (2000). Guest editors’ introduction: The top 10 algorithms. Computing in Science & Engineering, 22–23.Google Scholar
- 7.Fourer, R. (1994). Notes on the dual simplex method. Draft report.Google Scholar
- 8.Frisch, K. F. (1955). The logarithmic potential method of convex programming. Technical report, University Institute of Economics, Oslo, Norway.Google Scholar
- 15.Klee, V., & Minty, G. J. (1972). How good is the simplex algorithm. In O. Shisha (Ed.), Inequalities - III. New York and London: Academic Press Inc.Google Scholar
- 23.Samaras, N. (2001). Computational improvements and efficient implementation of two path pivoting algorithms. Ph.D. dissertation, Department of Applied Informatics, University of Macedonia (in Greek).Google Scholar
- 25.Von Neumann, J. (1947). On a maximization problem. Technical report, Institute for Advanced Study, Princeton, NJ, USA.Google Scholar