Linear programming and network flows/ Mokhtar S. Bazaraa, John J. Jarvis and Hanif D. Sherali
Material type: TextPublication details: New York: John Wiley & Sons, 1990Edition: 2ndDescription: xiv, 684 pages: charts, diagrams; 20 cmISBN:- 0471512842
- 9780471512844
- 23 519.72 B362
Item type | Current library | Call number | Status | Notes | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 519.72 B362 (Browse shelf(Opens below)) | Available | Gifted by SQC Unit | C27461 |
Includes bibliography and index
Introduction -- 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 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.