Optimal matching problems with costs given by Finsler distances
In this paper we deal with an optimal matching problem, that is, we want to transport two commodities (modeled by two measures that encode the spacial distribution of each commodity) to a given location, where they will match, minimizing the total transport cost that in our case is given by the sum...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_15340392_v14_n1_p229_Mazon |
| Aporte de: |
| Sumario: | In this paper we deal with an optimal matching problem, that is, we want to transport two commodities (modeled by two measures that encode the spacial distribution of each commodity) to a given location, where they will match, minimizing the total transport cost that in our case is given by the sum of the two different Finsler distances that the two measures are transported. We perform a method to approximate the matching measure and the pair of Kantorovich potentials associated with this problem taking limit as p → ∞ in a variational system of p-Laplacian type. |
|---|