Linear programming and network flows /
Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.
- 4th ed.
- Hoboken, N.J. : Wiley, 2010.
- xiv, 748 p. : ill. ; 25 cm.
Includes bibliographical references and 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-time 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.