A geometrical interpretation of the Hungarian method

In this paper a geometrical interpretation of the Hungarian method will be given. This special algorithm to solve the dual transportation problem is not restricted to the edges of the convex polyhedron of feasible solutions. Each covering-step can be considered as a determination of a direction of steepest descent, each reduction-step as movement along that direction to a boundary point of the polyhedron. The dimension of the face that will be crossed depends on the covering that is chosen.