Finding the most efficient DMU using mixed integer linear programming model

This paper presents a DEA model which is able to detect the most efficient DMU by solving only one mixed integer linear programming. The model can also be used for ranking all extreme efficient DMUs. Finally by using an example, the applicability of the proposed model is illustrated.

Keywords:

Data envelopment analysis , most efficient DMU , mixed integer programming