Network Flows and Monotropic Optimization

A rigorous and comprehensive treatment of network flow theory and monotropic optimization by one of the world's most renowned applied mathematicians.

This classic textbook, first published by J. Wiley & Sons, Inc., in 1984, covers extensively the duality theory and the algorithms of linear and nonlinear network optimization optimization, and their significant extensions to monotropic programming (separable convex constrained optimization problems, including linear programs).

Monotropic programming problems are characterized by a rich interplay between combinatorial structure and convexity properties. Rockafellar develops, for the first time, algorithms and a remarkably complete duality theory for these problems.