Abstract
Data envelopment analysis (DEA) evaluates the performance of decision making units (DMUs). When DEA models are used to calculate efficiency of DMUs, a number of them may have the equal efficiency 1. In order to choose a winner among DEA efficient candidates, some methods have been proposed. But most of these methods are not able to rank non-extreme efficient DMUs. Since, the researches performed about ranking of non-extreme efficient units are very limited, incomplete and with some difficulties, we are going to develop a new method to rank these DMUs in this paper. Therefore, we suppose that DMUo is a non-extreme efficient under evaluating DMU. In continue, by using “Representation Theorem”, DMUo can be represented as a convex combination of extreme efficient DMUs. So, we expect the performance of DMUo be similar to the performance of convex combination of these extreme efficient DMUs. Consequently, the ranking score of DMUo is calculated as a convex combination of ranking scores of these extreme efficient DMUs. So, the rank of this unit will be determined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
