arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.07106math.OC
收藏

带容量约束的传输多路径

Transport multi-paths with capacity constraints

Qinglan Xia, Haotian Sun

AI总结:

本文提出带容量约束的传输多路径模型,以分量成本之和定义传输成本,证明最优解存在并给出分量数上界,分析分量性质及相互作用。

摘要:

本文将分支/分叉最优传输的研究推广到具有容量约束的情形。这里研究的每个可容许传输网络都由测度之间的传输多路径表示,且其每个分量都带有容量约束。相应的传输成本由每个分量的$\textbf{M}_\alpha$-成本之和给出。利用这一新表述,我们证明了最优解的存在性,并给出了解的分量数量的上界。此外,我们对每个解分量的性质(如“映射相容性”和“简单公共源性质”)进行了分析性检验,并探讨了各分量之间的相互作用,特别是在离散情形下。

英文摘要:

This article generalizes the study of branched/ramified optimal transportation to those with capacity constraints. Each admissible transport network studied here is represented by a transport multi-path between measures, with a capacity constraint on each of its components. The associated transport cost is given by the sum of the $\textbf{M}_α$-cost of each component. Using this new formulation, we prove the existence of an optimal solution and provide an upper bound on the number of components for the solution. Additionally, we conduct analytical examinations of the properties (e.g. ``map-compatibility", and ``simple common-source property") of each solution component and explore the interplay among components, particularly in the discrete case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑