Abstract
The Multi-objective transportation problem refers to a special class of vector-minimum linear programming problems in which the constraints are of equality type and all the objectives are non-commensurable and conflict with each other. All the methods either generate a set of non-dominated solutions or find a compromise solution. In this paper, we use a special type of non-linear (hyperbolic and exponential) membership functions to solve the multi-objective transportation problem. It gives an optimal compromise solution. The obtained result has been compared with the solution obtained by using a linear membership function. To illustrate the methodology a numerical example is presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
