A Multi-Objective Transportation Problem Solve By Laxicographic Goal Programming
Kirti Kumar Jain1, Ramakant Bhardwaj2, Sanjay Choudhary3
1Kirti Kumar Jain, Research Scholar, Barkat-Ullah University Bhopal, (M.P.), India.
2Ramakant Bhardwaj, Department of Mathematics, Technocrats Institute of Technology, Bhopal,(M.P.), India.
3Sanjay Choudhary, Head, Department of Mathematics, Govt. NMV, Hoshangabad, (M.P.), India.
Manuscript received on 23 March 2019 | Revised Manuscript received on 30 March 2019 | Manuscript published on 30 March 2019 | PP: 1842-1846 | Volume-7 Issue-6, March 2019 | Retrieval Number: F2589037619/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© 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 this research paper, we assume a Multi-Objective Transportation Problem, which minimizes the total transportation transfer time and transportation cost. Here the transportation problem is solved by Lexicographic goal programming method. The solution resultant to the minimum distances gives the best settlement solution. This is a process used to solve a numerical example.
Keywords: Lexicographic goal programming, Multi-objective transportation problem, allocation resources.
Scope of the Article: Transportation Engineering