Linear programming and network flows / Mokhtar S. Bazaraa, John J. Jarvis.
By: Bazaraa, M. S
.
Contributor(s): Jarvis, John J.
Material type: 
BookPublisher: New York : Wiley, c1977Description: x, 565 p. : ill. ; 24 cm. + hbk.ISBN: 0471060151.Subject(s): Linear programming | Network analysis (Planning)DDC classification: 519.72 | Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
| General lending | MTU Bishopstown Library Store | 519.72 (Browse shelf(Opens below)) | 1 | Available | 00038378 | |
| General lending | MTU Bishopstown Library Lending | 519.72 (Browse shelf(Opens below)) | 1 | Available | 00047399 |
Enhanced descriptions from Syndetics:
Linear Programming and Network Flows, now in its third edition, addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequility constraints. This book: * Provides methods for modeling complex problems via effective algorithms on modern computers. * Presents the general theory and characteristics of optimization problems, along with effective solution algorithms. * Explores linear programming (LP) and network flows, employing polynomial-time algorithms and various specializations of the simplex method.
Bibliography: (pages 530-558) and index.
Introduction -- Results from linear algebra and convex analysis -- The simplex method -- Starting solution and convergence -- Special simplex forms and optimality conditions -- Duality and sensitivity -- The decomposition principle -- The transportation and assignment problems -- Minimal cost networks flows -- The out-of-kilter algorithm -- Maximal flow, shortest path and multicommodity flow problems.
Table of contents provided by Syndetics
- One
- Two
- Three
- Four
- Five
- Six
- Seven
- Eight
- Nine
- Ten
- Eleven
- Twelve
- Bibliography
- Index