MTU Library Catalogue

Syndetics cover image
Image from Syndetics

Linear programming and network flows / Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.

By: Bazaraa, M. S.
Contributor(s): Jarvis, John J | Sherali, Hanif D, 1952-.
Material type: materialTypeLabelBookPublisher: New York : Wiley, c1990Description: xiv, 684 p. : ill. ; 25 cm. + pbk.ISBN: 0471512842.Subject(s): Linear programming | Network analysis (Planning)DDC classification: 519.72
Contents:
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.
Holdings
Item type Current library Call number Copy number Status Barcode
General lending MTU Bishopstown Library Lending 519.72 (Browse shelf(Opens below)) 1 Available 00025882
Total holds: 0

Enhanced descriptions from Syndetics:

This work addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. It provides methods for modeling complex problems via effective algorithms on modern computers. The general theory and characteristics of optimization problems are presented, along with effective solution algorithms. The text also explores linear programming and network flows, employing polynomial-time algorithms and various specializations of the simplex method. Includes many numerical examples to illustrate theory and techniques.

Bibliography: (pages 626-672) 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.