Network Flows and Monotropic OptimizationDescribes optimization problem in which duality is an important computational tool, including network and linear programming. Introduces monotropic programming, a new form of mathematical programming developed by the author. |
Other editions - View all
Common terms and phrases
algorithm in Section applied breakpoint capacity intervals closed proper convex column combinatorial compatible condition constraints corresponding cut Q D. R. Fulkerson divx dual problem elementary circuit elementary primal support Example existence theorem feasible differential algorithm feasible distribution algorithm feasible distribution problem Figure finite flux incidence matrix infimum initial integral interval C(j iteration line search linear programming matrix max flow algorithm max flow problem max tension problem maximal minimizing monotropic programming network G node nonempty optimal differential problem optimal distribution algorithm optimal distribution problem optimal solution optimization problem out-of-kilter algorithm painted network algorithm pair path algorithm path problem piecewise linear pivoting potential primal and dual procedure programming problem proper convex function rectification algorithm regularly feasible solution satisfying sequence simplex method solving span intervals spanning tree subnetwork subroutine supremum theorem in Section thrifty adjustment algorithm Tucker representation Tucker tableau unbalanced values