Building on the analysis of simple problems with three source zones, a general but approximate method for solving the transportation problem of linear programming is proposed. The method uses successive adjustments to the row dual variables, and rapidly reduces the number of columns which need to be considered. It offers promising computational capabilities for problems where the ratio of the number of columns to the number of rows is very large.
Get full access to this article
View all access options for this article.
References
1.
BrandtAIntratorJ, 1971“The assignment problem with three job categories”Časopis pro Pěestování Matematiky968–11
2.
ChandrasekaranRRaoS, 1977“A special case of the transportation problem”Operations Research25(3) 525–528
3.
HarrisB, 1976“A code for the transportation problem of linear programming”Journal of the Association for Computing Machinery23(1) 155–157
4.
HarrisB, 1978“A new algorithm for tree modification in the primal transportation problem”Transportation Science12(4) 271–276
