On the Max Flow Min Cut Theorem of Networks.

Abstract : It is shown that Menger's theorem and the Max Flow Min Cut Theorem on networks are applications of the duality theorem of linear inequality theory.