Linear programming and network flows / Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.
Material type: TextPublication details: Hoboken, N.J. : John Wiley & Sons, c2010.Edition: 4th edDescription: xiv, 748 p. : ill. ; 25 cmISBN:- 9780470462720 (cloth)
- 0470462728 (cloth)
- 519.7/2 22
- T57.74 .B39 2010
Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
General Books | CUTN Central Library Sciences | 519.7/2 (Browse shelf(Opens below)) | 1 | Available | 12500 | |
General Books | CUTN Central Library Sciences | 519.7/2 (Browse shelf(Opens below)) | 2 | Available | 12499 | |
General Books | CUTN Central Library Sciences | 519.7/2 (Browse shelf(Opens below)) | 3 | Available | 12498 | |
General Books | CUTN Central Library Sciences | 519.7/2 (Browse shelf(Opens below)) | 4 | Available | 12497 | |
General Books | CUTN Central Library Sciences | 519.7/2 (Browse shelf(Opens below)) | 5 | Available | 12496 | |
General Books | CUTN Central Library Sciences | 519.7/2 (Browse shelf(Opens below)) | 6 | Available | 12495 | |
General Books | CUTN Central Library Sciences | 519.7/2 (Browse shelf(Opens below)) | 7 | Available | 12494 |
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.
There are no comments on this title.