Linear programming and network flows

Bazaraa,Mokhtar S.

Linear programming and network flows - 2nd ed. - Singapore: John Wiley & Sons, 2003. - xiv, 684 pages : illustrations ;

Bibliography & Index

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.


Thoroughly revised, this text on linear programming introduces new material on the simplex algorithm, polynomially-bounded algorithms and other algorithmic procedures. The book has been designed to provide material for both network flows and linear programming courses

9780471636816 0471636819 9780471512844 0471512842 9789812530417 981253041X


Linear programming.

519.72 / BAZ

© University of Vavuniya

---