Abstract
In this paper, a method is proposed to find all efficient solutions of 0-1 multi-objective linear programming (MOLP) problem. These solutions are specified without generating all feasible solutions. Corresponding to a feasible solution of 0-1 MOLP problem, a vector is constructed which its components are the values of objective functions. The method consists of a one-stage algorithm. In each iteration of this algorithm, for obtaining some efficient solutions of 0-1 MOLP problem, a 0-1 single objective linear programming problem is solved.
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.
