Elementary Linear Programming with Applications

PrefaceAcknowledgmentsPrologue Introduction to Operations Research Further ReadingsChapter 0 Review of Linear Algebra (Optional) 0.1 Matrices 0.2 Gauss-Jordan Reduction 0.3 The Inverse of a Matrix 0.4 Subspaces 0.5 Linear Independence and Basis Further ReadingsChapter 1 Geometry in Rn 1.1 Hyperplanes 1.2 Convex Sets Further ReadingChapter 2 Introduction to Linear Programming 2.1 The Linear Programming Problem 2.2 Matrix Notation; Geometric Solutions 2.3 The Simplex Method 2.4 Degeneracy and Cycling (Optional) 2.5 Artificial Variables Further ReadingsChapter 3 Further Topics in Linear Programming 3.1 Duality 3.2 Computational Relations Between the Primal and Dual Problems 3.3 The Dual Simplex Method 3.4 The Revised Simplex Method 3.5 Sensitivity Analysis 3.6 Computer Aspects (Optional) Further ReadingsChapter 4 Integer Programming 4.1 Examples 4.2 Cutting Plane Methods 4.3 Branch and Bound Methods 4.4 Computer Aspects (Optional) Further ReadingsChapter 5 Special Types of Linear Programming Problems 5.7 The Transportation Problem Further Readings 5.2 The Assignment Problem Further Readings 5.3 Graphs and Networks. Basic Definitions Further Reading 5.4 The Maximal Flow Problem Further Readings 5.5 The Shortest Route Problem Further Readings 5.6 The Critical Path Method Further Readings 5.7 Computer Aspects (Optional)Solutions to Odd-Numbered ExercisesIndex