Zusammenfassung
Es wird eine Klasse von dreidimensionalen Transportproblemen beschrieben, deren Lösung auf das Lösen klassischer Transportprobleme zurückgeführt werden kann. Es wird ferner ein Beispiel für ein derartiges Problem angegeben, dessen zugehöriger Polyeder die volle Dimension hat.
Summary
A class of planar three-index transportation problems is described which can be reduced to classical transportation problems. Moreover an example of a polytope with full dimension having this property is given.
This is a preview of subscription content, log in via an institution to check access.
References
Haley KB (1962) The solid transportation problem. J Oper Res 10:448–463
Haley KB (1963) The multi-index problem. J Oper Res 11:368–379
Junginger W (1972) Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem. Z Operations Research 16:11–25
Raskin LG, Kiričenko IO (1982) Mnogoindexnyi zadači linejnogo programmirovanija. Radio i Svjaz, Moscow
Schell ED (1955) Distribution of a product by several properties. Proc. 2nd Symposium in Linear Programming, Washington, DC, pp 615–642
Schmid K (1966) Zurückführung eines Sortenproblems auf das dreidimensionale Transportproblem. Unternehmensforschung 10:32–41
Vlach M (1986) Conditions for the existence of solutions of the three-dimensional planar transpor- tation problem. Discrete Appl Math 13:61–78
Yemelichev VA, Kovalev MM, Kravtsov MK (1984) Polytopes, graphs and optimization. Cambridge University Press. Cambridge
Author information
Authors and Affiliations
Additional information
On leave from Byelorussian Polytechnical Institute Leninski pr. 65, 220027 Minsk, USSR.
Rights and permissions
About this article
Cite this article
Korsnikov, A.D. Planar three-index transportation problems with dominating index. Zeitschrift für Operations Research 32, 29–33 (1988). https://doi.org/10.1007/BF01920570
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01920570