scientific article; zbMATH DE number 4001832
Any nonnegative measure c on \(X=\{(x,y)|\) \(x,y\in {\mathbb{R}}\), \(-1/2\leq x\leq 1/2\), \(| x| +| y| =1\}\) is called a capacity in X. For every \(\omega\in \Omega\), with \(\Omega =\{\omega |\omega \in [- 1,1]^{[-1,1]}\), \(|\omega(s) - \omega(t)| \leq | s-t|\) (\(| s|,| t| \leq 1)\}\), \(P(\omega,\cdot)\) denotes the arc length measure living on the intersection of X and that graph. P thus is a kernel from \(\Omega\) to X. It transports measures \(\mu\) from \(\Omega\) to X. The author considers the following problem: Maximize the total mass \(\mu\) 1 of \(\mu\) under the constraint \(\mu\) \(P\leq c\), and its dual: Minimize, for a given measure c in X, the expression cf while obeying the condition \(Pf\geq 1\), with \(f\geq 0\) varying in a suitable class of bounded measurable functions. This thesis addresses the question whether or not there exists an analog to the max flow-min cut theorem of Ford-Fulkerson and treats a number of variations on the above mentioned problems.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754409)