Analytic proofs of a network feasibility theorem and a theorem of Fulkerson

Abstract We provide an elementary proff of Fulkerson's theorem which gives the permutation matrices as extreme points of a certain unbounded convex polyhedron. An adaptation of the proof also establishes an analogous feasibility theorem for network flows which has Fulkerson's theorem as a corollary.