Skip to main content
Log in

On Sharma-Swarup algorithm for time minimising transportation problems

  • Published:
Proceedings of the Indian Academy of Sciences - Mathematical Sciences Aims and scope Submit manuscript

Abstract

In this note, the fallacy in the method given by Sharma and Swarup, in their paper on time minimising transportation problem, to determine the setS hkof all nonbasic cells which when introduced into the basis, either would eliminate a given basic cell (h, k) from the basis or reduce the amountx hkis pointed out.

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, Kanti Swarup 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. Log. Q. 18 465

    Article  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. Ramakrishnan C S 1977Opsearch 14 207

    MathSciNet  Google Scholar 

  6. Sharma J K and Kanti Swarup 1977Proc. Indian Acad. Sci. (Math. Sci.) A86 513

    Google Scholar 

  7. Szwarc W 1971Nav. Res. Log. 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

Seshan, C.R., Tikekar, V.G. On Sharma-Swarup algorithm for time minimising transportation problems. Proc. Indian Acad. Sci. (Math. Sci.) 89, 101–102 (1980). https://doi.org/10.1007/BF02837265

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation