Dual potentials for capacity constrained optimal transport

From MaRDI portal



Abstract: Optimal transportation with capacity constraints, a variant of the well-known optimal transportation problem, is concerned with transporting one probability density finL1(mathbbRm) onto another one ginL1(mathbbRn) so as to optimize a cost function cinL1(mathbbRm+n) while respecting the capacity constraints . A linear programming duality theorem for this problem was first established by Levin. In this note, we prove under mild assumptions on the given data, the existence of a pair of L1-functions optimizing the dual problem. Using these functions, which can be viewed as Lagrange multipliers to the marginal constraints f and g, we characterize the solution h of the primal problem. We expect these potentials to play a key role in any further analysis of h. Moreover, starting from Levin's duality, we derive the classical Kantorovich duality for unconstrained optimal transport. In tandem with results obtained in our companion paper (arXiv:1309.3022), this amounts to a new and elementary proof of Kantorovich's duality.


The main result is devoted to the existence of dual potentials for the capacity constrained optimal transport and the characterization of optimality. As a significant consequence, the authors derive the classical Kantorovich duality of the optimal transport from Levin's duality.











This page was built for publication: Dual potentials for capacity constrained optimal transport

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493196)