Linear programming and network flows

By: Bazaraa,Mokhtar SContributor(s): Sherali, Hanif D | Jarvis, John JMaterial type: TextTextPublication details: Singapore: John Wiley & Sons, 2003Edition: 2nd edDescription: xiv, 684 pages : illustrationsISBN: 9780471636816 ; 0471636819 ; 9780471512844; 0471512842 ; 9789812530417 ; 981253041XSubject(s): Linear programmingDDC classification: 519.72
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 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; Bibliography; Index.
Summary: Thoroughly revised, this text on linear programming introduces new material on the simplex algorithm, polynomially-bounded algorithms and other algorithmic procedures. The book has been designed to provide material for both network flows and linear programming courses
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Reference Books Reference Books Main Library
Reference 		Reference 519.72 BAZ (Browse shelf(Opens below)) Available 009565
Total holds: 0

Bibliography & 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 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; Bibliography; Index.


Thoroughly revised, this text on linear programming introduces new material on the simplex algorithm, polynomially-bounded algorithms and other algorithmic procedures. The book has been designed to provide material for both network flows and linear programming courses

There are no comments on this title.

to post a comment.

© University of Vavuniya

---