A measure-theoretical max-flow-min-cut problem (Q583082): Difference between revisions

We investigate a measure-theoretical generalization of the famous max- flow-min-cut Theorem of Ford/Fulkerson for networks to continuous flows in bounded regions in the plane. A flow is a measure on the set of all rectifiable Jordan curves ``from the left to the right'' that satisfies a certain capacity condition. The value of a flow is its total measure. We prove that the duality \(\max\)- flow\(=\min\)-cut holds, if a cut is defined as a rectifiable Jordan curve ``from the bottom to the top'' and the value of such a cut is the arc length of the curve weighted by the capacity.