About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
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.