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


Bibliographic record and links to related information available from the Library of Congress catalog


Information from electronic data provided by the publisher. May be incomplete or contain other coding.


Counter Addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. Provided are 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. 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.

Library of Congress subject headings for this publication: