On network flow functions


  • Presented at The RAND Symposium on Mathematical Programming, Santa Monica, California, March 16–20, 1959.


This article covers an investigation of the capacity of a network as a function of the capacities of its individual arcs. The case of two variables was investigated in detail, and it was found that each pair of arcs either consistently help each other or consistently hinder each other. Interaction types were computed for a number of special cases, such as arcs in parallel or arcs in series.