DISCRETE INFINITE TRANSPORTATION PROBLEMS

被引：3

作者：

KORTANEK, KO ^{[1
]}

YAMASAKI, M ^{[1
]}

机构：

[1] SHIMANE UNIV,DEPT MATH,MATSUE,SHIMANE,JAPAN

来源：

DISCRETE APPLIED MATHEMATICS | 1995年 / 58卷 / 01期

关键词：

DENUMERABLY INFINITE TRANSPORTATION PROBLEMS; LINEAR PROGRAMMING; TOPOLOGICAL PAIRING; FINITE CONSTRUCTIVE APPROXIMATIONS; INFINITE PROBLEM RELAXATIONS;

D O I：

10.1016/0166-218X(93)E0139-P

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：19 / 33

页数：15

共 16 条

[1]

Anderson E. J., 1987, LINEAR PROGRAMMING I

[2]

Bourbaki N., 1955, ESPACES VECTORIELS T

[3]

DUFFIN RJ, 1956, LINEAR INEQUALITIES, P157

[4]

Kantorovich LV., 1958, VESTNIK LENINGRAD U, V13, P52

[5] ON THE TRANSLOCATION OF MASSES [J].

KANTOROVITCH, L .

MANAGEMENT SCIENCE, 1958, 5 (01) :1-4

[6] DUALITY THEOREMS FOR MARGINAL PROBLEMS [J].

KELLERER, HG .

ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1984, 67 (04) :399-432

[7]

KEMPERMAN JHB, 1983, LECT NOTES ECON MATH, V215, P63

[8] EQUALITIES IN TRANSPORTATION PROBLEMS AND CHARACTERIZATIONS OF OPTIMAL-SOLUTIONS [J].

KORTANEK, KO ;

YAMASAKI, M .

NAVAL RESEARCH LOGISTICS, 1980, 27 (04) :589-595

[9]

KORTANEK KO, 1990, WORKING PAPER SERIES, V9016

[10] PROGRAMMES IN PAIRED SPACES [J].

KRETSCHMANN, K .

CANADIAN JOURNAL OF MATHEMATICS, 1961, 13 (02) :221-&

← 1 2 →