Linear programming and network flows / Mokhtar S. Bazaraa, Agility Logistics, John J. Jarvis, Georgia Institute of Technology School of Industrial Systems Engineering, Hanif D. Sherali, Virginia Polytechnic Institute and State University Grado Department of Industrial and System Engineering.

By: Bazaraa, M. S [author.]Contributor(s): Jarvis, John J [author.] | Sherali, Hanif D, 1952- [author.]Material type: TextTextLanguage: English Hoboken, N.J. : John Wiley & Sons, 2010©2010. Edition: Fourth editionDescription: xiv, 748 pages : illustrations ; 25 cmContent type: text Media type: unmediated Carrier type: volumeISBN: 0470462728 (cloth)Subject(s): Linear programming | Network analysis (Planning)LOC classification: T57.74 .B39 2010
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-time 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.
Item type Current library Shelving location Call number Copy number Status Date due Barcode
Books MEF Üniversitesi Kütüphanesi
Genel Koleksiyon T 57.74 .B39 2010 (Browse shelf (Opens below)) Available 0000971

Includes bibliographical references and 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-time 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.

1