Linear programming and network flows
By: Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali
Contributors: Jarvis, John J.; Sherali, Hanif D., 1952-
Edition: 4th ed.
Publisher: John Wiley & Sons; Wiley
Published: 2010
Place of publication: Hoboken, N.J
Language: eng
Number of pages: 748
ISBN-13: 9780470462720
Notes: Includes bibliographical references and index.
Table of contents: title: Linear algebra, convex analysis, and polyhedral sets; title: The simplex method; title: Starting solution and convergence; title: Special simplex implementations and optimality conditions; title: Duality and sensitivity analysis; title: The decomposition principle; title: Complexity of the simplex algorithm and polynomial-time algorithms; title: Minimal-cost network flows; title: The transportation and assignment problems; title: The out-of-kilter algorithm; title: Maximal flow, shortest path, multicommodity flow, and network synthesis problems.