Journal article
Discrete infinite transportation problems
Discrete Applied Mathematics, Vol.58(1), pp.19-33
03/10/1995
DOI: 10.1016/0166-218X(93)E0139-P
Abstract
The finite classical transportation problem is extended to an infinite one having a countable number of origins and destinations. The approach taken is essentially discrete and requires no compactness, measure theoretic, or metric properties of any of its constructions. Duality results are presented for the infinite transportation problem extension and its dual, as well as for two of the relaxations. A constructive approximation procedure is given for obtaining program values arbitrarily close to the infinite program values of the extension.
Details
- Title: Subtitle
- Discrete infinite transportation problems
- Creators
- Kenneth O. Kortanek - University of IowaMaretsugu Yamasaki - Shimane University
- Resource Type
- Journal article
- Publication Details
- Discrete Applied Mathematics, Vol.58(1), pp.19-33
- DOI
- 10.1016/0166-218X(93)E0139-P
- ISSN
- 0166-218X
- eISSN
- 1872-6771
- Publisher
- Elsevier B.V
- Number of pages
- 15
- Language
- English
- Date published
- 03/10/1995
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963107302771
Metrics
2 Record Views