A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique (Q928617)

Summary: In this paper a method for finding efficient solutions of a 0-1 multiple objective linear (nonlinear) programming problem using data envelopment analysis (DEA) technique is proposed. In this method, for each feasible solution of 0-1 multiple objective programming (0-1 MOP) problem, a decision making unit (DMU) is introduced. Using the additive model, the relative efficiency of these DMUs is evaluated. Each feasible solution corresponding to an efficient DMU is the efficient solution of 0-1 MOP problem.