Amazon cover image
Image from Amazon.com

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

By: Contributor(s): Material type: TextTextPublication details: Hoboken, N.J. : John Wiley & Sons, c2010.Edition: 4th edDescription: xiv, 748 pages. : illustrations. ; 25 cmISBN:
  • 9780470462720 (cloth)
  • 0470462728 (cloth)
Subject(s): DDC classification:
  • 519.72 B362l 2010 22
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Books Books Premier University Department of Mathematics Library 519.72 B362l 2010 1 Available 28189
Books Books Premier University Department of Mathematics Library 519.72 B362l 2010 2 Available 28190

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.

Mathematics.

There are no comments on this title.

to post a comment.
©️ All Right Reserved by: Premier University Library

Powered by Koha