Semi-Infinite Transportation Problems
Copyright policy )Semi-Infinite Transportation Problems
An old set partitioning problem is treated as a special case of the Kantorovic-Monge transportation problem. This problem is then related to Klötzler’s transportation flow problems which allow the consideration of a local cost rate, instead of the constant cost rate in the Kantorovic-Monge problem. Three possibilities for the; numerical solution of the problem are discussed and briefly compared.
- Leipzig University Germany
set partitioning, transportation problem, market area problem, Deterministic network models in operations research, transportation flow problems, Semi-infinite programming, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), Duality theory (optimization)
set partitioning, transportation problem, market area problem, Deterministic network models in operations research, transportation flow problems, Semi-infinite programming, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), Duality theory (optimization)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!