Linear Programming and Network Flows

Linear Algebra, Convex Analysis, and Polyhedral Sets; The Simplex Method; Starting Solution and Convergence; Special Simplex Implementations and Optimality Conditions; Duality and Sensitivity Analysis; The Decomposition Principle; Complexity of the Simplex Algorithm and Polynomial Algorithms; Minimal Cost Network Flows; The Transportation and Assignment Problems; The Out-of-Kilter Algorithm; Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems; Bibliography; Index.