Linear programming. Foundations and extensions (Q5891086)

This is the fourth edition of the classic textbook on linear programming. It follows the proven structure of the earlier editions concering the simplex method and duality in Part 1. It then discusses network problems in Part 2, before moving to interior point methods in Part 3 and extensions (integer, quadratic and convex programming) in Part 4. An appendix contains source code listings for the self-dual and homogeneous self-dual simplex methods. Compared to the third addition new material concerning the average performance of the simplex method has been added to Chapters 4 (Efficiency of the Simplex Method) and 12 (Regression).