Skip to main content
Log in

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bhatia H L, Swarup K and Puri M C 1977Indian J. Pure Appl. Math. 8 920

    MATH  MathSciNet  Google Scholar 

  2. Garfinkel R S and Rao M R 1971Nav. Res. Logist Q. 18 465

    Article  MathSciNet  Google Scholar 

  3. Hammer P L 1969Nav. Res. Logist Q. 16 345

    MATH  MathSciNet  Google Scholar 

  4. Hammer P L 1971Nav. Res. Logist Q. 18 487

    Article  MathSciNet  Google Scholar 

  5. Hughes A J and Grawiog D E 1973Linear Programming: An emphasis on Decision making (USA: Addison-Wesley) pp. 300–312

    MATH  Google Scholar 

  6. Ramakrishnan C S 1977Opsearch 14 207

    MathSciNet  Google Scholar 

  7. Seshan C R and Tikekar V G 1980Proc. Indian Acad. Sci. (Math. Sci.) 89 101

    Article  MATH  MathSciNet  Google Scholar 

  8. Sharma J K and Swarup K 1977Proc. Indian Acad. Sci. (Math. Sci.) 86 513

    MathSciNet  Google Scholar 

  9. Szwarc W 1971Nav. Res. Logist Q. 18 473

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02837260

Keywords

Navigation