Linear programming and network flows / Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.

Author/creator Bazaraa, M. S.
Other author Jarvis, John J.
Other author Sherali, Hanif D., 1952-
Format Electronic
Edition4th ed.
Publication InfoHoboken, N.J. : John Wiley & Sons,
Descriptionxiv, 748 p. : ill. ; 25 cm.
Supplemental ContentFull text available from Ebook Central - Academic Complete
Subjects

Contents 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.
Bibliography noteIncludes bibliographical references and index.
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
LCCN 2009028769
ISBN9780470462720 (cloth)
ISBN0470462728 (cloth)

Availability

Library Location Call Number Status Item Actions
Electronic Resources Access Content Online ✔ Available