Semi-infinite transportation problems

Kenneth O Kortanek; Maretsugu Yamasaki

doi:10.1016/0022-247X(82)90214-1

Back

Journal article

Open access

Peer reviewed

Semi-infinite transportation problems

Kenneth O Kortanek and Maretsugu Yamasaki

Journal of mathematical analysis and applications, Vol.88(2), pp.555-565

01/01/1982

DOI: 10.1016/0022-247X(82)90214-1

Files and links (1)

url

https://doi.org/10.1016/0022-247X(82)90214-1View

Published (Version of record) Open Access

Abstract

A semi-infinite transportation dual-program pair is specified which involves general pairings of linear spaces stemming from an infinite number of destination requirements, but where in the primal program least-cost flows of goods are sought from only a finite number of origins to these destinations. Building on the work of M. J. Todd [Solving the generalized market area problem, Management Sci. 24 (1978), 1549–1554] a finite-dimensional dual unconstrained concave program is developed for the primal semi-infinite program but without certain measure-theoretic restrictions on the cost functions themselves. Optimality conditions for the dual-program pair are specified involving generalized column number conditions which parellel but extend those of the classical finite-dimensional transportation problem.

Details

Title: Subtitle: Semi-infinite transportation problems
Creators: Kenneth O Kortanek - Carnegie Mellon University
Maretsugu Yamasaki - Shimane University
Resource Type: Journal article
Publication Details: Journal of mathematical analysis and applications, Vol.88(2), pp.555-565
DOI: 10.1016/0022-247X(82)90214-1
ISSN: 0022-247X
eISSN: 1096-0813
Publisher: Elsevier Inc
Number of pages: 11
Language: English
Date published: 01/01/1982
Academic Unit: Business Analytics
Record Identifier: 9984963201902771

Metrics

6 Record Views