Linear programming and network flows
Bazaraa, M. S.
creator
Jarvis, John J.
Sherali, Hanif D.
1952-
text
tu
Hoboken, N.J
John Wiley & Sons
c2010
4th ed.
xiv, 748 p. : ill. ; 25 cm.
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.
Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.
Includes bibliographical references and index.
Linear programming
Network analysis (Planning)
T57.74 .B39 2010
519.7/2
9780470462720 (cloth)
DLC
131111
20140528154643.0
5655