Linear Programming Computation

Ping-Qi Pan is Professor and Doctoral Supervisor of Mathematics Department at Southeast University, Nanjing, China. He was Visiting Scholar at University of Washington (1986–1987), and Visiting Scientist at Cornell University (1987–1988). His research interest focuses on mathematical programming and operations research, especially large-scale linear optimization. He was standing council member of Mathematical Programming Society of China, and standing council member of Operation Research Society of China. Professor Pan has received the honorary title of Outstanding Scientific-Technical Worker of Jiangsu Province of China. He was nominated as Top 100 scientist of 2012 by the International Biographical Centre, Cambridge, England. He won the LIFETIME ACHIEVEMENT AWARD by Who’s Who in the World in 2017.

• Chapter 1. Introduction.- Chapter 2. Geometry of Feasible Region.- Chapter 3. Simplex Method.- Chapter 4. Implementation of Simplex Method.- Chapter 5. Duality Principle and Dual Simplex Method.- Chapter 6. Primal-Dual Simplex Method.- Chapter 7. Sensitivity Analysis and Parametric LP.- Chapter 8. Generalized Simplex Method.- Chapter 9. Decomposition Method.- Chapter 10. Interior-Point Method.- Chapter 11. Integer Linear Programming (ILP).- Chapter 12. Pivot Rule.- Chapter 13. Dual Pivot Rule.- Chapter 14. Simplex Phase-I Method.- Chapter 15. Dual Simplex Phase-l Method.- Chapter 16. Reduced Simplex Method.- Chapter 17. D-Reduced Simplex Method.- Chapter 18. Generalized Reduced Simplex Method.- Chapter 19. Deficient-Basis Method.- Chapter 20. Dual Decient-Basis Method.- Chapter 21. Face Method with Cholesky Factorization.- Chapter 22. Dual Face Method with Cholesky Factorization.- Chapter 23. Face Method with LU Factorization.- Chapter 24. Dual Face Method with LU Factorization.- Chapter 25. Simplex Interior-Point Method.- Chapter 26. Facial Interior-Point Method.- Chapter 27. Decomposition Principle.