A multi-objective transportation problem solve by laxicographic goal programming

ISSN: 22773878
2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

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.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free