“I am finding this book useful both for students and other readers interested in this field, welcomed in the operation research literature.” (Zentralbaltt MATH
, June 2005)
--This text refers to an out of print or unavailable edition of this title.
From the Publisher
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.