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.
"The book can be used both as reference and as textbook for advanced undergraduate students and first–year graduate students in the fields of industrial engineering, management, operation research, computer science, mathematics and other engineering disciplines that deal with the subjects of linear programming and network flows." (Zentralblatt MATH, 2011)