Linear programming and network flows /
By: Bazaraa, M. S.
Contributor(s): Jarvis, John J | Sherali, Hanif D.
Material type:
BookPublisher: Hoboken, N.J. : John Wiley & Sons, c2010Edition: 4th ed.Description: xiv, 748 p. : ill.ISBN: 9780470462720 (cloth); 0470462728 (cloth).Subject(s): Linear programming | Network analysis (Planning)DDC classification: 519.7/2 Online resources: Click here to access online
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.
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
ebooks
|
HEC Digital Library | 519.7/2 (Browse shelf) | Available |
Total holds: 0
Browsing HEC Digital Library Shelves Close shelf browser
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.
There are no comments for this item.