A polynomial-time algorithm for finding epsilon in DEA models
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.
non-archimedean epsilon data envelopment analysis polynomial time algorithm