|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 2 van 25 gevonden artikelen
| Titel: |
An Approach using a Branch-and-Bound Algorithm for Evaluating the Performance of Inefficient DMUs in DEA |
| Auteur: |
G.R. Jahanshahloo J. Vakili S.M. Mirdehghan |
| Verschenen in: |
Journal of applied sciences |
| Paginering: | Jaargang 11 (2011) nr. 3 pagina's 450-461 |
| Jaar: |
2011 |
| Inhoud: |
Evaluating the performance of Decision-Making Units (DMUs) is a very important subject in Data Envelopment Analysis (DEA) and DEA does this by assigning a relative efficiency score to each DMU. In spite of the great importance of this subject, the majority of the methods presented in the different studies have not attempted to evaluate the performance of the inefficient DMUs beyond the relative efficiency scores attained from the standard DEA models. In this study, the minimum distance of each inefficient DMU from the efficient frontier is obtained by a branch-and-bound algorithm and then these distances are used as a criterion for evaluating the performance of the inefficient DMUs. It is known that using this method for evaluation is more realistic compared to other methods and also this method is able to remove the existing difficulties in some models, say, the CCR and BCC models. Also, this study proposes the use of the minimum distance of an inefficient DMU from the efficient frontier in order to obtain the shortest projection from the evaluated DMU to the efficient frontier, thus allowing an inefficient DMU to find the easiest way to improve its efficiency. |
| Uitgever: |
Asian Network for Scientific Information (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 2 van 25 gevonden artikelen
| << vorige | volgende >> |