Ebook: Linear Programming: An Introduction to Finite Improvement Algorithms

Suitable for undergraduate students of mathematics and graduate students of
operations research and engineering, this text covers the basic theory and computation for
a first course in linear programming. In addition to substantial material on mathematical
proof techniques and sophisticated computation methods, the treatment features numerous
examples and exercises. An introductory chapter offers a systematic and organized
approach to problem formulation. Subsequent chapters explore geometric motivation, proof
techniques, linear algebra and algebraic steps related to the simplex algorithm, standard
phase 1 problems, and computational implementation of the simplex algorithm. Additional
topics include duality theory, issues of sensitivity and parametric analysis, techniques for
handling bound constraints, and network flow problems. Helpful appendixes conclude the
text, including a new addition that explains how to use Excel to solve linear programming
problems