An epsilon-free approach for finding the most efficient unit in DEA

Mehdi Toloo*

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةArticleمراجعة النظراء

48 اقتباسات (Scopus)


Data envelopment analysis (DEA), considering the best condition for each decision making unit (DMU), assesses the relative efficiency and partitions DMUs into two sets: efficient and inefficient. Practically, in traditional DEA models more than one efficient DMU are recognized and these models cannot rank efficient DMUs. Some studies have been carried out aiming at ranking efficient DMUs, although in some cases only discrimination of the most efficient unit is desirable. Furthermore, several investigations have been done for finding the most CCR-efficient DMU. The basic idea of the majority of them is to introduce an integrated model which achieves an optimal common set of weights (CSW). These weights help us identify the most efficient unit in an identical condition.Recently, Toloo (2012) [13] proposed a new mixed integer programming (MIP) model to find the most BCC-efficient unit. Based on this study, we propose a new basic integrated linear programming (LP) model to identify candidate DMUs for being the most efficient unit; next a new MIP integrated DEA model is introduced for determining the most efficient DMU. Moreover, these models exclude the non-Archimedean epsilon and consequently the optimal solution of these models can be obtained, straightforwardly. We claim that the most efficient unit, which could be obtained from all other integrated models, has to be one of the achieved candidates from the basic integrated LP model. Two numerical examples are illustrated to show the variant use of these models in different important cases.

اللغة الأصليةEnglish
الصفحات (من إلى)3182-3192
عدد الصفحات11
دوريةApplied Mathematical Modelling
مستوى الصوت38
رقم الإصدار13
المعرِّفات الرقمية للأشياء
حالة النشرPublished - يوليو 1 2014
منشور خارجيًانعم

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2611???
  • ???subjectarea.asjc.2600.2604???

قم بذكر هذا