A new data envelopment analysis method for ranking decision making units: an application in industrial parks
Mohammad Izadikhah, Reza Farzipoor Saen
Abstract
Mohammad Izadikhah, Reza Farzipoor Saen
Abstract
Abstract Relative efficiency of decision‐making units (DMUs) is assessed by classical data envelopment analysis (DEA) models. DEA is a popular technique for efficiency evaluation. There might be a couple of efficient DMUs. Classical DEA models cannot fully rank efficient DMUs. In this paper, a novel technique for fully ranking all DMUs based on changing reference set using a single virtual inefficient DMU is proposed. To this end, the first concept of virtual DMU is defined as average of all inefficient DMUs. Virtual DMU is a proxy of all inefficient DMUs. This new method proposes a new ranking method that takes into account impact of efficient DMUs on virtual DMU and impact of efficient DMUs on influences of other efficient DMUs. A case study is given to show applicability of the proposed approach.
OpenAlex reports 35 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract Relative efficiency of decision‐making units (DMUs) is assessed by classical data envelopment analysis (DEA) models. DEA is a popular technique for efficiency evaluation. There might be a couple of efficient DMUs. Classical DEA models cannot fully rank efficient DMUs. In this paper, a novel technique for fully ranking all DMUs based on changing reference set using a single virtual inefficient DMU is proposed. To this end, the first concept of virtual DMU is defined as average of all inefficient DMUs. Virtual DMU is a proxy of all inefficient DMUs. This new method proposes a new ranking method that takes into account impact of efficient DMUs on virtual DMU and impact of efficient DMUs on influences of other efficient DMUs. A case study is given to show applicability of the proposed approach.
Key concepts: Data envelopment analysis, Ranking (information retrieval), Computer science, Rank (graph theory), Proxy (statistics), Efficiency, Set (abstract data type), Data mining