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.
CITATION STYLE
Jain, K. K., Bhardwaj, R., & Choudhary, S. (2019). A multi-objective transportation problem solve by laxicographic goal programming. International Journal of Recent Technology and Engineering, 7(6), 1842–1846.
Mendeley helps you to discover research relevant for your work.