Abstract
The problem of minimizing the duration of transportation has been studied. The problem has been reduced to a goal programming-type problem which readily lends itself to solution by the standard transportation method. This approach to the solution of the problem is very much different from all other existing ones.
Similar content being viewed by others
References
Bhatia H L, Swarup K and Puri M C 1977Indian J. Pure Appl. Math. 8 920
Garfinkel R S and Rao M R 1971Nav. Res. Logist Q. 18 465
Hammer P L 1969Nav. Res. Logist Q. 16 345
Hammer P L 1971Nav. Res. Logist Q. 18 487
Hughes A J and Grawiog D E 1973Linear Programming: An emphasis on Decision making (USA: Addison-Wesley) pp. 300–312
Ramakrishnan C S 1977Opsearch 14 207
Seshan C R and Tikekar V G 1980Proc. Indian Acad. Sci. (Math. Sci.) 89 101
Sharma J K and Swarup K 1977Proc. Indian Acad. Sci. (Math. Sci.) 86 513
Szwarc W 1971Nav. Res. Logist Q. 18 473
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Prakash, S. On minimizing the duration of transportation. Proc. Indian Acad. Sci. (Math. Sci.) 91, 53–57 (1982). https://doi.org/10.1007/BF02837260
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02837260