scholarly journals Transportation-cost inequality on path spaces with uniform distance

2008 ◽  
Vol 118 (12) ◽  
pp. 2181-2197 ◽  
Author(s):  
Shizan Fang ◽  
Feng-Yu Wang ◽  
Bo Wu
Author(s):  
H. Sánchez-Larios ◽  
S. Guillén-Burguete

In this paper, we give theoretical foundations for modeling distance functions on the usual Euclidean space R exp. n, where distance may refer to physical kilometers, liters of fuel consumed, time spent in traveling, or transportation cost. In our approach, a distance function d is derived from a function F0 called the fundamental function of d. Our distance functions, unlike metrics, can be asymmetric and non-positive definite, and unlike the Lp norms, they can be nonuniform. We illustrate our theoretical framework by modeling an asymmetric and non-uniform distance function on R2 which can take negative values.


Author(s):  
FUMIO HIAI ◽  
YOSHIMICHI UEDA

The free analogue of the transportation cost inequality so far obtained for measures is extended to the noncommutative setting. Our free transportation cost inequality is for tracial distributions of noncommutative self-adjoint (also unitary) multi-variables in the framework of tracial C*-probability spaces, and it tells that the Wasserstein distance is dominated by the square root of the relative free entropy with respect to a potential of additive type (corresponding to the free case) with some convexity condition. The proof is based on random matrix approximation procedure.


2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.


Sign in / Sign up

Export Citation Format

Share Document