Abstract
Some linear programming problems have simple forms which enable easier or more efficient methods of solution to be used. Most of these methods rely on the basic simplex method already described. They follow the same sort of procedure in that a solution is found which satisfies the equations and this solution is altered to reduce the total cost.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1967 K. B. Haley
About this chapter
Cite this chapter
Haley, K.B. (1967). The Transportation Problem. In: Mathematical Programming for Business and Industry. Studies in Management. Palgrave, London. https://doi.org/10.1007/978-1-349-00111-8_3
Download citation
DOI: https://doi.org/10.1007/978-1-349-00111-8_3
Publisher Name: Palgrave, London
Print ISBN: 978-1-349-00113-2
Online ISBN: 978-1-349-00111-8
eBook Packages: Palgrave Business & Management CollectionBusiness and Management (R0)