ملخص
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.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 803-805 |
عدد الصفحات | 3 |
دورية | Computers and Operations Research |
مستوى الصوت | 31 |
رقم الإصدار | 5 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - أبريل 2004 |
منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1700???
- ???subjectarea.asjc.2600.2611???
- ???subjectarea.asjc.1800.1803???