A polynomial-time algorithm for finding E in DEA models

A polynomial-time algorithm for finding E in DEA models

This paper presents a new algorithm for computing the non-Archimedean in DEA models. It is shown that this algorithm is polynomial-time of O(n), where n is the number of decision making units (DMUs). Also it is proved that using only inputs and outputs of DMUs, the non-Archimedean can be found such...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research 2004-04, Vol.31 (5), p.803-805
Hauptverfasser: Amin, Gholam R, Toloo, Mehdi
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Decision making units
Mathematical analysis
Operations research
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents a new algorithm for computing the non-Archimedean in DEA models. It is shown that this algorithm is polynomial-time of O(n), where n is the number of decision making units (DMUs). Also it is proved that using only inputs and outputs of DMUs, the non-Archimedean can be found such that, the optimal values of all CCR models, which are corresponding to all DMUs, are bounded and an assurance value is obtained. [PUBLICATION ABSTRACT]
ISSN:0305-0548
0305-0548
DOI:10.1016/S0305-0548(03)00072-8