Provides a systematic account of the main algorithms derived from the simplex method and the means by which they may be organized into effective procedures for solving practical linear programming problems on a computer.

PART I: BASIC THEORY AND METHOD 1. Linear Programs and Their Solution 2. The Simplex Method PART II: PRACTICAL ASPECTS 3. Problem Setup 4. The Basis Matrix--Fundamentals of Numerical Computation and Numerical Linear Algebra 5. The Basis Matrix--Factorizing and Solving 6. The Basis Matrix--Updating and Solving 7. Selection Strategies--Choosing the Entering and Exiting Variables 8. Selection Strategies--Finding an Initial Feasible Solution 9. Practical Implementation 10. Mathematical Programming Systems in Practice PART III: OPTIMIZATION PRINCIPLE + SIMPLEX METHOD = LP ALGORITHM 11. The Duality Principle and the Simplex Method 12. The Decomposition Principle and the Simplex Method 13. The Homotopy Principle and the Simplex Method

"Will provide a very solid background for anyone wanting to understand the ideas behind linear programming." --Choice |k No