Transportprobleme und Graphentheorie

Abstract

The two following theorems are proven: Theorem A: A feasible solution is an extreme point of the convex polyhedron M (defined as the set of all feasible solutions) if and only if the corresponding graph is without circuit. Theorem B: An extreme point of the convex polyhedron M is not degenerate if and only if the corresponding graph is connected. The assignment problem is treated as an example. © 1967 Physica-Verlag.