Key points are not available for this paper at this time.
One: Introduction.Two: Linear Algebra, Convex Analysis, and Polyhedral Sets.Three: The Simplex Method.Four: Starting Solution and Convergence.Five: Special Simplex Implementations and Optimality Conditions.Six: Duality and Sensitivity Analysis.Seven: The Decomposition Principle.Eight: Complexity of the Simplex Algorithms.Nine: Minimal-Cost Network Flows.Ten: The Transportation and Assignment Problems.Eleven: The Out-of-Kilter Algorithm.Twelve: Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems.Bibliography.Index.
Sergeant et al. (Mon,) studied this question.