Equalities in transportation problems and characterizations of optimal solutions
β Scribed by Kenneth O. Kortanek; Maretsugu Yamasaki
- Publisher
- John Wiley and Sons
- Year
- 1980
- Tongue
- English
- Weight
- 304 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
This paper considers the classical finite linear transportation Problem (I) and two relaxations, (II) and (III), of it based on papers by Kantorovich and Rubinstein, and Kretschmer. Pseudoβmetric type conditions on the cost matrix are given under which Problems (I) and (II) have common optimal value, and a proper subset of these conditions is sufficient for Problems (II) and (III) to have common optimal value. The relationships between the three problems provide a proof of Kantorovich's original characterization of optimal solutions to the standard transportation problem having as many origins as destinations. The result are extended to problems having cost matrices which are nonnegative rowβcolumn equivalent.
π SIMILAR VOLUMES
A linear state and control constrained problem arising in optimal routing in communication networks is investigated by Fenchel duality methods. The problem reduces to a dual program having a particularly simple solution.