An Innovative Route to Acquire Least Cost in Transportation Problems
P.Sumathi1, C.V.Sathiya Bama2
1P.Sumathi, Department of Mathematics, Bharath Institute of Higher Education and Research, Chennai, Tamilnadu, India.
2C.V.Sathiya Bama, Department of Mathematics, Bharath Institute of Higher Education and Research, Chennai, Tamilnadu, India.
Manuscript received on September 13, 2019. | Revised Manuscript received on October 20, 2019. | Manuscript published on October 30, 2019. | PP: 5368-5369 | Volume-9 Issue-1, October 2019 | Retrieval Number: A3070109119/2019©BEIESP | DOI: 10.35940/ijeat.A3070.109119
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In Linear Programming Problem, Transportation Problem (TP) is a particular approach to reach the cost. Purpose of TP is to reduce the cost. Transportation model provides a great support to find out the best way to distribute supplies to client. An inventive hypothesis is discussed for getting optimal cost in transportation problem in this paper. The proposed work compared with also Vogel’s Approximation and MODI methods. This approach is confirmed with various numerical illustrations.
Keywords: Initial Basic Feasible Solution (IBFS), Optimal Cost, Vogel’s Approximation Method (VAM), MODI, Transportation Problem (TP). AMS classification: 90 – 90B, 90C.