Now in its third, comprehensively updated edition, this esteemed text addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. The book addresses the practical aspects of building LP models, solving them on computer, and interpreting LP solutions.

Linear Programming and Network Flows, now in its third edition, addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequility constraints. This book: * Provides methods for modeling complex problems via effective algorithms on modern computers. * Presents the general theory and characteristics of optimization problems, along with effective solution algorithms. * Explores linear programming (LP) and network flows, employing polynomial-time algorithms and various specializations of the simplex method.