:: Volume 8, Issue 1 (1-2018) ::
2018, 8(1): 47-55 Back to browse issues page
A model for finding the most efficient DMU in DEA
H. Ghorban Shiroudi , F. Hosseinzadeh Lotfi
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
Abstract:   (4915 Views)
Finding the most efficient DMU in DEA is an important issue for decision makers. In this paper, we consider some of existing models which try to find the most efficient DMU and we present some of their drawbacks. Then, we propose a model which provides more discrimination between DMUs. This model tries to find a hyperplane which pass through a DMU with large distance from the others, and a single unit then turns out to be the most efficient one. Finally, we check the model by a numerical example.
Keywords: Data Envelopment Analysis, The Most Efficient DMU, Hyperplane
Full-Text [PDF 427 kb]   (2268 Downloads)    
Type of Study: Research | Subject: General
Received: 2017/05/12 | Accepted: 2017/09/20 | Published: 2018/01/10


XML     Print



Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 8, Issue 1 (1-2018) Back to browse issues page