A method for solving 0-1 multiple objective linear programming problem using dea

Abstract

In this paper, by using Data Envelopment Analysis (DEA) technique a method is proposed to find efficient solutions of 0-1 Multiple Objective Linear Programming (MOLP) problem. In this method from a feasible solution of 0-1 MOLP problem, a Decision Making Unit (DMU) without input vector is constructed in which output vector for DMU is the values of objective functions. The method consists of a two-stage algorithm. In the first stage, some efficient solutions are generated. In the second stage, the DMUs corresponding to the generated efficient solutions in the first stage together with the generated DMUs in the previous iterations are evaluated by using the additive model without input.