Open Access   Article

Reduction Method Using Minimum Supply And Demand Method to Find an Initial Basic Feasible Solution of Transportation Problem

N.M. Morade1

Section:Research Paper, Product Type: Journal Paper
Volume-7 , Issue-1 , Page no. 46-50, Jan-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i1.4650

Online published on Jan 31, 2019

Copyright © N.M. Morade . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

Citation

IEEE Style Citation: N.M. Morade , “Reduction Method Using Minimum Supply And Demand Method to Find an Initial Basic Feasible Solution of Transportation Problem”, International Journal of Computer Sciences and Engineering, Vol.7, Issue.1, pp.46-50, 2019.

MLA Style Citation: N.M. Morade "Reduction Method Using Minimum Supply And Demand Method to Find an Initial Basic Feasible Solution of Transportation Problem." International Journal of Computer Sciences and Engineering 7.1 (2019): 46-50.

APA Style Citation: N.M. Morade , (2019). Reduction Method Using Minimum Supply And Demand Method to Find an Initial Basic Feasible Solution of Transportation Problem. International Journal of Computer Sciences and Engineering, 7(1), 46-50.

VIEWS PDF XML
45 69 downloads 9 downloads
  
  
           

Abstract

Transportation Problem plays an important role in our economy and managerial decision- making. The main objective of transportation problem solving method is to obtain an optimal solution. An initial basic feasible solution is the first step to obtain an optimal solution for the transportation problems. Among the existing methods, Vogel’s Approximation Method gives an initial basic feasible solution near to the optimal solution, but it is very expansive in term of the execution of time. This paper introduces a new method, Reduction Method using minimum supply & demand method, to find an initial basic feasible solution of Transportation Problem. This method is easy to apply and fast compared to Vogel’s Approximation Method. It gives better initial basic feasible solution compared to all existing prominent methods. The method is also illustrated with numerical examples.

Key-Words / Index Term

Linear Programming, Assignment, Transportation problem, initial basic feasible solution, Reduction method using Supply & Demand method

References

[1] KAPOOR V. K., “Operations Research ( Quantitative Techniques for management )”, Sultan Chand & Sons Publisher, India ,pp. 5.3-5.97, 2008.
[2] M. K. Hasan, “Direct Methods for Finding Optimal Solution of a Transportation Problem are not Always Reliable”, International Refereed Journal of Engineering and Science , Vol. 1, Issue. 2, pp.46-52, 2012.
[3] N. M. Morade, “New Method to find initial basic feasible solution of Transportation Problem using MSDM” , International Journal of Computer Sciences and Engineering, Vol.5, issue.12, pp.223-226, 2017.
[4] P.K.Gupta and D.S.Hira, “ Operations Research”, Sultan Chand & Sons Publisher , India, pp. 148 -210,1997.
[5] P.K. Gupta and M. Mohan, “Problems in Operations Research”, Sultan Chand & Sons Publisher, India, pp. 337 -400, 1997.
[6] S.D. Sharma, “Operations Research Theory, Methods and Applications”, Kedar Nath Ram Nath & Co., India, pp. 347 -434, 2003.