Duality theorems for a continuous analog of Ford-Fulkerson flows in networks (Q1325747)

\textit{T. C. Hu} [`Integer programming and network flows' (1969; Zbl 0294.90052)] and \textit{K. Jacobs} [in: Game theory and related topics, Proc. Semin., Bonn/Hagen 1978, 301-307 (1979; Zbl 0432.90076)] independently proposed continuous analogs of Ford-Fulkerson flows in networks. Their models are different, but both showed that there are difficulties in obtaining max flow \(=\) min cut theorems. Using a definition of continuous network which already has been shown to be natural and useful for solving combinatorial problems the authors prove that there is no duality gap.