A method for ranking non-extreme DMUs in Tv using minimum face

One of the main problems in ranking DMUs using Data Envelopment Analysis is the ranking of non- extreme efficient DMUs. Most proposed methods only can rank extreme DMUs. Although in practice, it happen rarely that we have non-extreme efficient DMUs, but in theatrical point of view, we must able to rank them. In this paper we propose a method to rank non-extreme DMUs in Tv. We do this with finding a positive convex combination (with best score) of extreme efficient DMUs locating on the minimum face containing the non-extreme DMU

Keywords:

ranking , Data Envelopment Analysis , Minimum Face