Bazaraa, Mokhtar S. <br/><br/>
Linear Programming and Network Flows / 
Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali. 
 - 3rd ed. 
 - [S.l.] :  Wiley-Interscience,  2004. 
 - 744 p. ;  24 cm. 
<br/><br/>Introduction (Page-1), Linear Algebra, Convex Analysis, and Polyhedral Sets (Page-43), The Simplex Method (Page-89), Starting Solution and Convergence (Page-149), Special Simplex Implementations and Optimality Conditions (Page-197), Duality and Sensitivity Analysis (Page-255), The Decomposition Principle (Page-333), Complexity of the Simplex Algorithms (Page-383), Minimal-Cost Network Flows (Page-445), The Transportation and Assignment Problems (Page-505), The Out-of-Kilter Algorithm (Page-555), Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems (Page-595). 
<br/><br/><label>ISBN: </label>0471485993 9780471485995 
<br/><br/><label>Dewey Class. No.: </label>519.72,BAZ