Linear Programming Algorithms
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.
- 1.Dantzig, G. B. (1953). Computational algorithm of the revised simplex method. RAND Report RM-1266, The RAND Corporation, Santa Monica, CA.Google Scholar
- 3.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).