"Linear Programming" is a concise, thorough, mathematical introduction to the theory of linear programming, viewed as a study of algorithms. Requiring nothing more than basic linear algebra for comprehension, it presents rigorous and lucid expositions of such topics as the simplex algorithm, the ellipsoid algorithm, and Karmarkar’s algorithm. It provides for the practitioner a blend of rigor, intuition, and motivation for understanding the theory and applying it to such topics as game theory and algorithm design.

A distinctive feature of the book is a detailed proof of the polynomiality of running time for Karmarkar’s algorithm and ellipsoid algorithm. Another is its computer science prospective which addresses the issue of computational complexity with great care.

Practitioners, advanced undergraduate and graduate students in mathematics, computer science, operations research, and numerical analysis will find this book a mathematically satisfying exposition of linear programming. They will also find it an accessible adjunction to and application of a course in linear algebra.