Ranking efficient DMUs using the Tchebycheff norm

One problem that has been discussed frequently in data envelopment analysis (DEA) literature has been lack of discrimination in DEA applications, in particular when there are insufficient DMUs or the number of inputs and outputs is too high relative to the number of units. This is an additional reason for the growing interest in complete ranking techniques. In this paper a method for ranking extreme efficient decision making units (DMUs) is proposed. The method uses L∞(or Tchebycheff) Norm, and it seems to have some superiority over other existing methods, because this method is able to remove the existing difficulties in some methods, such as Andersen and Petersen [2] (AP) that it is sometimes infeasible. The suggested model is always feasible.