Advertisement

A Note on Zero Suffix Method for the Optimal Solution of the Transportation Problems

  • Gourav Gupta
  • Sandeep Singh
  • Deepika Rani
Short Communication
  • 4 Downloads

Abstract

Classical methods of finding the optimal solution of a transportation problem requires, initial basic feasible solution using any of the appropriate method like north-west corner rule, least cost method, Vogel’s approximation method etc. This obtained solution is improved towards the optimal solution by checking the optimality criteria using any of the existing methods, e.g., the modified distribution method, stepping-stone method etc. But Sudhakar et al. (Eur J Sci Res 68:254–257, 2012) suggested an approach called the zero suffix method that gives the optimal solution for transportation problems directly, i.e., without finding the initial basic feasible solution initially.

Keywords

Transportation problem Optimal solution Zero suffix method 

Notes

Acknowledgements

The second (SS) and third (DR) authors would like to thank CSIR, Government of India for providing financial support. The authors are thankful to the corresponding editor and the anonymous reviewers for utilizing their precious time in reviewing this paper.

References

  1. 1.
    Sudhakar VJ, Arunsankar N, Karpagam T (2012) A new approach for finding an optimal solution for transportation problems. Eur J Sci Res 68:254–257Google Scholar
  2. 2.
    Taha HA (1992) Operations research: an introduction, 5th edn. Macmillan Publishing Company, New YorkMATHGoogle Scholar

Copyright information

© The National Academy of Sciences, India 2018

Authors and Affiliations

  1. 1.School of SciencesBaddi University of Emerging Sciences and TechnologyHimachal PradeshIndia
  2. 2.Department of MathematicsAkal UniversityTalwandi SaboIndia
  3. 3.Department of MathematicsDr. B. R. Ambedkar National Institute of TechnologyJalandharIndia

Personalised recommendations