Dual-Matrix Approach for Solving the Transportation
Problem

Vijay Sharma; Dr. Chandra Bhusan Sharma

doi:https://doi.org/10.14445/22315373/IJMTT-V22P508

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 22 | Number 1 | Year 2015 | Article Id. IJMTT-V22P508 | DOI : https://doi.org/10.14445/22315373/IJMTT-V22P508

Dual-Matrix Approach for Solving the Transportation Problem

Vijay Sharma, Dr. Chandra Bhusan Sharma

Abstract

An Algorithm has been developed for solving special types of transportation problem having total demand more than or equal to the total supply. This algorithm is useful for solving both balanced and unbalanced transportation problems. The dual-matrix approach is used in the present algorithm.

Keywords

Transportation problem, dual-matrix approach, stepping-stone method, simplex method, linear programming models.

References

[1]. Charnes A. and W. W, Cooper (1954), The stepping stone method for explaining linear Programming calculations in transportation problems. Management Science 1, 49-69.
[2]. Ping JI and K.F. CHU (2002), A Dual-Matrix Approach to the transportation problem. Asia Pacific Journal of Operational Research. 35-45
[3]. S. D. Sharma (2003), Operations Research, Kedar Nath Ram Nath & Company, India.
[4]. Ford, L. R. and D.R. Fulkerson (1956) , Solving Transportation Problem, Management Science3, 24-32
[5]. Goyal S. K. (1984), Improving VAM for unbalanced transportation problems. Journal of Operational Research Society 35, 1113-1114.
[6]. Shafaat, A. and S. K. Goyal, (1988), Resolution of degeneracy in transportation Problem, Journal of Operational Research Society 39, 411-413

Citation :

Vijay Sharma, Dr. Chandra Bhusan Sharma, "Dual-Matrix Approach for Solving the Transportation Problem," International Journal of Mathematics Trends and Technology (IJMTT), vol. 22, no. 1, pp. 45-51, 2015. Crossref, https://doi.org/10.14445/22315373/IJMTT-V22P508