Developing a Support Vector Distance for ranking efficient units in DEA

Ranking efficient units has always been one of the most important issues and challenges in Data Envelopment Analysis (DEA). In this paper, we propose a method based on the Support Vector (SV) distance to rank these units. The main idea of this method is to find a hyperplane that can distinguish an efficient unit from others and has the maximum margin. The performance of the method is also demonstrated on a numerical example.

کلیدواژه ها:

Ranking ، Support Vector Machines ، Hyperplane