A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite families
Document Type
Article
Publication Date
9-2003
Department
Department of Mathematical Sciences
Abstract
A discrete mass transportation problem, studied by Kellerer, is extended to the case of infinitely many sites. An application to general representant systems is given, which generalizes M. Hall's extension of P. Hall's theorem to the case of infinite families of sets.
Publication Title
Mathematical Methods of Operations Research
Recommended Citation
Pinelis, I.
(2003).
A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite families.
Mathematical Methods of Operations Research,
58(1), 105-129.
http://doi.org/10.1007/s001860300285
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4652