A multi-material transport problem with arbitrary marginals

DOI10.1007/S00526-021-01967-XzbMATH Open1462.49075arXiv1807.10969OpenAlexW3157046751WikidataQ115386683 ScholiaQ115386683MaRDI QIDQ829402FDOQ829402

Authors: Riccardo Tione, Andrea Marchese, Annalisa Massaccesi, Salvatore Stuvard 

Publication date: 6 May 2021

Published in: Calculus of Variations and Partial Differential Equations (Search for Journal in Brave)

Abstract: In this paper we study general transportation problems in $mathbb{R}^n$, in which $m$ different goods are moved simultaneously. The initial and final positions of the goods are prescribed by measures $m{u}^{-}$, $m{u}^{+}$ on $mathbb{R}^n$ with values in $mathbb{R}^m$. When the measures are finite atomic, a discrete transportation network is a measure $T$ on $mathbb{R}^n$ with values in $mathbb{R}^{nimesm}$ represented by an oriented graph $mathcalG$ in $mathbb{R}^n$ whose edges carry multiplicities in $mathbb{R}^m$. The constraint is encoded in the relation $mdiv(T)=m{u}^{-}-m{u}^{+}$. The cost of the discrete transportation $T$ is obtained integrating on $mathcalG$ a general function $mathcalC:mathbb{R}^{m}omathbbR$ of the multiplicity. When the initial data $left(m{u}^{-},m{u}^{+}ight)$ are arbitrary (possibly diffuse) measures, the cost of a transportation network between them is computed by relaxation of the functional on graphs mentioned above. Our main result establishes the existence of cost-minimizing transportation networks for arbitrary data $left(m{u}^{-},m{u}^{+}ight)$. Furthermore, under additional assumptions on the cost integrand $mathcalC$, we prove the existence of transportation networks with finite cost and the stability of the minimizers with respect to variations of the given data. Finally, we provide an explicit integral representation formula for the cost of rectifiable transportation networks, and we characterize the costs such that every transportation network with finite cost is rectifiable.

Full work available at URL: https://arxiv.org/abs/1807.10969

Recommendations

• A multimaterial transport problem and its convex relaxation via rectifiable \(G\)-currents
• Optimal networks for mass transportation problems
• General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
• Optimal transportation networks. Models and theory
• Problèmes de transport multi-marginal de Monge-Kantorovich : une caractérisation des solutions

zbMATH Keywords

cost-minimizing transportation networksdiscrete transportation network

Mathematics Subject Classification ID

Optimal transportation (49Q22) Variational problems in a geometric measure-theoretic setting (49Q20) Optimization of shapes other than minimal surfaces (49Q10) Transportation, logistics and supply chain management (90B06) Geometric measure and integration theory, integral and normal currents in optimization (49Q15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An introduction to the theory of functional equations and inequalities. Cauchy's equation and Jensen's inequality. Edited by Attila Gilányi
• The deformation theorem for flat chains
• Rectifiable sets, densities and tangent measures
• A variational model of irrigation patterns
• Equivalent formulations for the branched transport and urban planning problems
• Fractal regularity results on optimal irrigation patterns
• OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
• Optimal transportation networks. Models and theory
• Decomposition of acyclic normal currents in a metric space
• Rectifiable and flat \(G\) chains in a metric space
• Improved stability of optimal traffic paths
• Title not available (Why is that?)
• Flat Chains Over a Finite Coefficient Group
• Rectifiability of flat chains
• Some basic theorems on flat \(G\) chains
• On the well-posedness of branched transportation
• The Steiner tree problem revisited through rectifiable \(G\)-currents
• Normal currents: structure, duality pairings and div-curl lemmas
• General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
• A fractal shape optimization problem in branched transport
• Stability for the mailing problem
• On the lower semicontinuous envelope of functionals defined on polyhedral chains
• An optimal irrigation network with infinitely many branching points
• A multimaterial transport problem and its convex relaxation via rectifiable \(G\)-currents

Cited In (7)

• Title not available (Why is that?)
• A multimaterial transport problem and its convex relaxation via rectifiable \(G\)-currents
• Ramified Optimal Transportation with Payoff on the Boundary
• The weak convergence of varifolds generated by rectifiable flat G$G$‐chains
• Connecting measures by means of branched transportation networks at finite cost
• Transport of measures on networks
• Generic uniqueness of optimal transportation networks

This page was built for publication: A multi-material transport problem with arbitrary marginals

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