Title of article
A new linear method to find the congestion hyperplane in DEA
Author/Authors
Ebrahimzade Adimi, M 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 , Hosseinzadeh Lotfi, F Department of Mathematics - Science and Research Branch - Islamic Azad University, Tehran , Mehrjoo, R Department of Mathematics - Shahr‑e‑Qods Branch - Islamic Azad University
Pages
10
From page
43
To page
52
Abstract
DEA is the way of evaluating the performance of decision-making units on the basis of the degree of efficiency. Unfortunately, congestion has been known as a technical inefficiency for at least three decades just because of the lack of determining the congestion border. In this article, we have introduced the concept of the congestion hyperplane without considering the efficiency value. This has considerably reduced the calculation, and the congestion border has been determined. In addition, the existence of this hyperplane is ascertained. For this purpose, we determine the BCC-efficient DMUs. The normal vector of the hyperplane is denoted by these values. This hyperplane can pass from any of the BCC-efficient DMUs. Next, we have shown that the previous congestion methods are covered and improved by this hyperplane.
Keywords
Data envelopment analysis (DEA) , Congestion , Hyperplane , Linear programming , Decision-making units (DMU)
Serial Year
2019
Record number
2493946
Link To Document