A method for generating all efficient solutions of 0-1 multi-objective linear programming problem

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.