A polynomial-time algorithm for finding ε in DEA models

被引：84
|
作者：
Amin, GR [1 ]
Toloo, M [1 ]
机构：
[1] Islamic Azad Univ, Sci & Res Branch, Dept Math, Tehran, Iran
来源：
COMPUTERS & OPERATIONS RESEARCH | 2004年 / 31卷 / 05期
关键词：
data envelopment analysis; non-Archimedean epsilon; polynomial time algorithm;
D O I：
10.1016/S0305-0548(03)00072-8
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper presents a new algorithm for computing the non-Archimedean epsilon in DEA models. It is shown that this algorithm is polynomial-time of 0(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 epsilon 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. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码：803 / 805
页数：3
相关论文
共 50 条
12345