Notes on Linear Programming
Part XXXIV A Primal Dual Algorithm for the Capacitated Hitchcock Problem
An algorithm for solving capacitated Hitchcock problems and a proof of convergence in a finite number of steps. The proposed algorithm is a generalization of a combinatorial method discovered by Kuhn for the optimal assignment problem. It uses as a subroutine the flow algorithm previously developed.