Author/Authors :
Nejati, N.Matin Department of Mathematics - Science and Research Branch, Islamic Azad University, Tehran , Rostamy-Malkhalifeh, M. Department of Mathematics - Science and Research Branch, Islamic Azad University, Tehran , Karger, R. Department of Mathematics - Qom Branch, Islamic Azad University, Tehran , Mehrjoo, R. Department of Mathematics - Shahr-e-Gods Branch, Islamic Azad University, Tehran
Abstract :
Data Envelopment Analysis (DEA) is a useful and practical to evaluate the performance based on multiple inputs and multiple outputs. DEA can determine efficient and non-efficient decision-making units (DMUs) through performance calculations. The most efficient unit is the DMU that is ranked among the most efficient units. However, there is no need to rank all units in order to obtain the most efficient decision-making unit. In this paper, the efficient unit hyperplane is selected with the help of the genetic algorithm of all the efficient units, which is the total distance between all the units on the other side of this hyperplane is the maximum amount possible with this hyperplane.
Keywords :
Data Envelopment Analysis , Genetic Algorithm , Hyperplane , Efficient Unit
