Linear Programming and Network Flows (3)

"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.

It presents the general theory and characteristics of optimization problems, along with effective solution algorithms.

It explores linear programming (LP) and network flows, employing polynomial - time algorithms and various specializations of the simplex method.