Linear Programming Computation

Introduction.-Geometry of the Feasible Region.- Simplex Method.- Duality principle and dual simplex method.- Implementation of the Simplex Method.- Sensitivity Analysis and Parametric LP.- Variants of the Simplex Method.- Decomposition Method.- Interior Point Method.- Integer Linear Programming (ILP).- Pivot Rule.- Dual Pivot Rule.- Simplex Phase-I Method.- Dual Simplex Phase-l Method.- Reduced Simplex Method.- Improved Reduced Simplex Method.- D-Reduced Simplex Method.- Criss-Cross Simplex Method.- Generalizing Reduced Simplex Method.- Deficient-Basis Method.- Dual Deficient-Basis Method.- Face Method.- Dual Face Method.- Pivotal interior-point Method.- Special Topics.- Appendix.- References

lt;p>"Evidenced by superior performance in computational experiments, the author's work has refreshed the state of the art of LP, and by its originality, breadth and depth, is having a major impact on the field of mathematical optimization." (EJOR, European Journal of Operational Research, Vol. 267 (3), June, 2018)

"The book seems to be mainly addressed to scientists who already possess some expertise in LP. The kind of presentation, however, also allows using parts of it as a basis for a course on the topic. In fact, a special feature of the book is that an algorithm typically is accompanied by some example for which the results of all computational steps needed to find a solution are written down." (Rembert Reemtsen, zbMATH, Vol. 1302, 2015)

"This book is a research monograph focusing on computational techniques in the simplex method for linear programming. ... It may be of interest to researchers and developers of simplex method codes for linear programming." (B. Borchers, Choice, Vol. 52 (3), November, 2014)