Linear Programming and Network Flows / Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.
Publisher: [S.l.] : Wiley-Interscience, 2004Edition: 3rd edDescription: 744 p. ; 24 cmISBN: 0471485993; 9780471485995DDC classification: 519.72,BAZ| Item type | Current location | Home library | Shelving location | Call number | URL | Status | Notes | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|---|---|
Reference
|
Military College of Signals (MCS) | Military College of Signals (MCS) | Reference | 519.72,BAZ (Browse shelf) | Link to resource | Not for loan | Almirah No.19, Shelf No.5 | MCS31500 |
Introduction (Page-1), Linear Algebra, Convex Analysis, and Polyhedral Sets (Page-43), The Simplex Method (Page-89), Starting Solution and Convergence (Page-149), Special Simplex Implementations and Optimality Conditions (Page-197), Duality and Sensitivity Analysis (Page-255), The Decomposition Principle (Page-333), Complexity of the Simplex Algorithms (Page-383), Minimal-Cost Network Flows (Page-445), The Transportation and Assignment Problems (Page-505), The Out-of-Kilter Algorithm (Page-555), Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems (Page-595).
Click on an image to view it in the image viewer
There are no comments on this title.