The important issue of the aggregation preference is how to determine the weights associated with different ranking places and DEA models play an important role in this subject. DEA models use assignments of the same aggregate value (equal to unity) to evaluate multiple alternatives as efficient. Furthermore, overly diverse weights can appear, thus, the efficiency of different alternatives obtained by different sets of weights may be unable to be compared and ranked on the same basis. In order to solve two above problems, and rank all the alternatives on the same scale, in this paper, we propose a multiple objective programming (MOP) approach for generating a common set of weights in the DEA framework. Also, we develop a novel model to make a maximum discriminating among candidates’ rankings. Additionally, we present two scenarios to provide suitable strategies for solving the proposed MOP model.

Keywords: Multi-objective programming, Voting, Aggregation of preferences, Data envelopment analysis, Common set of weights, Ranking

Full-Text [PDF 146 kb]   (526 Downloads)