A PRIMAL METHOD FOR MINIMAL COST FLOWS WITH APPLICATIONS TO THE ASSIGNMENT AND TRANSPORTATION PROBLEMS.

Authors :: Klein, Morton
Source :: Management Science; Nov67, Vol. 14 Issue 3, p205-220, 16p
Publication Year :: 1967
Abstract: A simple procedure is given for solving minimal cost flow problems in which feasible flows are maintained throughout. It specializes to give primal algorithms for the assignment and transportation problems. Convex cost problems can also be handled. [ABSTRACT FROM AUTHOR]

Subjects :: TRANSPORTATION problems (Programming)
LINEAR programming
CONVEX functions
ALGORITHMS
REAL variables
MANAGEMENT education
INDUSTRIAL applications
MATHEMATICAL models
NETWORK analysis (Planning)

Full Text Access

Tools