Abstract
A large number of linear programs actually solved are transportation problems or possess a structure of the same type. This special structure allows very efficient implementation of the simplex algorithm (so that very large transportation problems can be solved). This structure also has a great theoretical interest since network flow problems present the very same structure. For these two reasons, the transportation problem deserves special study in a course on linear programming.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sakarovitch, M. (1983). The Transportation Problem. In: Thomas, J.B. (eds) Linear Programming. Springer Texts in Electrical Engineering. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4106-3_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4106-3_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90829-8
Online ISBN: 978-1-4757-4106-3
eBook Packages: Springer Book Archive