Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/157483 
Erscheinungsjahr: 
2016
Quellenangabe: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 12 [Publisher:] Springer [Place:] Heidelberg [Year:] 2016 [Pages:] 237-242
Verlag: 
Springer, Heidelberg
Zusammenfassung: 
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.
Schlagwörter: 
Data envelopment analysis (DEA)
Ranking
Efficiency
Extreme efficient
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article

Datei(en):
Datei
Größe
374.95 kB





Publikationen in EconStor sind urheberrechtlich geschützt.