Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T10:27:06.733Z Has data issue: false hasContentIssue false

Two dimensional optimal transportation problem for a distance cost with a convex constraint∗

Published online by Cambridge University Press:  04 July 2013

Ping Chen
Affiliation:
School of Science, Nanjing University of Science and Technology, Nanjing 210094, P.R. China. chenping200517@126.com; jfd2001@163.com; yangxp@mail.njust.edu.cnSchool of Mathematics and Computer Science, Anhui Normal University, Wuhu 241000, P.R. China
Feida Jiang
Affiliation:
School of Science, Nanjing University of Science and Technology, Nanjing 210094, P.R. China. chenping200517@126.com; jfd2001@163.com; yangxp@mail.njust.edu.cn
Xiaoping Yang
Affiliation:
School of Science, Nanjing University of Science and Technology, Nanjing 210094, P.R. China. chenping200517@126.com; jfd2001@163.com; yangxp@mail.njust.edu.cn

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We first prove existence and uniqueness of optimal transportation maps for the Monge’s problem associated to a cost function with a strictly convex constraint in the Euclidean plane ℝ2. The cost function coincides with the Euclidean distance if the displacement y − x belongs to a given strictly convex set, and it is infinite otherwise. Secondly, we give a sufficient condition for existence and uniqueness of optimal transportation maps for the original Monge’s problem in ℝ2. Finally, we get existence of optimal transportation maps for a cost function with a convex constraint, i.e. y − x belongs to a given convex set with at most countable flat parts.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2013