This problem is usually a transportation problem with a third index that refers to a product type. Here there are i origins, j destinations and k types of products available at the origins and demanded at the destinations. The variables x ijk represent the amount of the kth product shipped from the ith origin to the jth destination. The constraint set is a set of linear balance equations, with the usual linear cost objective function. It is also a special form of the multi-commodity network-flow problem. Unlike the transportation problem, its optimal solution may not be integer-valued even if the network data are given as integers. The problem can also be defined with more than three indices. Multicommodity network flows; Transportation problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Multidimensional transportation problem . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_651
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_651
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive