Externally indexed torrent

If you are the original uploader, contact staff to have it moved to your account

Textbook in PDF format

In the second volume, the `simplex feasible-point algorithm' was rewritten, and removed from the chapter Pivotal Interior-Point Method to form an independent chapter with the new title `Simplex Interior-Point Method', as it represents a class of efficient interior-point algorithms transformed from traditional simplex algorithms. The title of the original chapter was then changed to `Facial Interior-Point Method', as the remaining algorithms represent another class of efficient interior-point algorithms transformed from normal interior-point algorithms. Without exploiting sparsity, the original primal/dual face methods were implemented using Cholesky factorization. In order to deal with sparse computation, two new chapters discussing LU factorization were added to the second volume. The most exciting improvement came from the rediscovery of the reduced simplex method. In the first edition, the derivation of its prototype was presented in a chapter with the same title, and then converted into the so-called `improved' version in another chapter. Fortunately, the author recently found a quite concise new derivation, so he can now introduce the distinctive fresh simplex method in a single chapter. It is exciting that the reduced simplex method can be expected to be the best LP solver ever.With a focus on computation, the current edition contains many novel ideas, theories and methods, supported by solid numerical results. Being clear and succinct, its content reveals in a fresh manner, from simple to profound. In particular, a larger number of examples were worked out to demonstrate algorithms. This book is a rare work in LP and an indispensable tool for undergraduate and graduate students, teachers, practitioners, and researchers in LP and related fields.
Foundations
Introduction
Geometry of Feasible Region
Simplex Method
Implementation of Simplex Method
Duality Principle and Dual Simplex Method
Primal-Dual Simplex Method
Sensitivity Analysis and Parametric LP
Generalized Simplex Method
Decomposition Method
Interior-Point Method
Integer Linear Programming (ILP)
Advances
Pivot Rule
Dual Pivot Rule
Simplex Phase-I Method
Dual Simplex Phase-l Method
Reduced Simplex Method
D-Reduced Simplex Method
Generalized Reduced Simplex Method
Deficient-Basis Method
Dual Deficient-Basis Method
Face Method with Cholesky Factorization
Dual Face Method with Cholesky Factorization
Face Method with LU Factorization
Dual Face Method with LU Factorization
Simplex Interior-Point Method
Facial Interior-Point Method
Decomposition Principle