Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/157483 
Year of Publication: 
2016
Citation: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 12 [Publisher:] Springer [Place:] Heidelberg [Year:] 2016 [Pages:] 237-242
Publisher: 
Springer, Heidelberg
Abstract: 
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The main purpose of this paper is to overcome the lack of infeasibility and unboundedness in some DEA ranking methods. The proposed method is for ranking extreme efficient DMUs in DEA based on exploiting the leave-one out and minimizing distance between DMU under evaluation and virtual DMU.
Subjects: 
Data envelopment analysis (DEA)
Ranking
Efficiency
Extreme efficient
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size
374.95 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.