.png){kind=icon}
Return
A polynomial-time algorithm for finding ε in DEA models
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(03)00072-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
data envelopment analysis
non-Archimedean epsilon
polynomial time algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
.png){kind=icon}
