A polynomial-time algorithm for finding ɛ in DEA models

Authors:
Gholam R. Amin;Mehdi Toloo
Affiliations:
Department of Mathematics, Islamic Azad University, Science & Research Branch, Tehran, Iran;Department of Mathematics, Islamic Azad University, Science & Research Branch, Tehran, Iran
Venue:
Computers and Operations Research
Year:
2004

Citing 1
Cited 5

An Assurance Interval for the Non-Archimedean Epsilon in DEA Models

Operations Research

Finding the most efficient DMUs in DEA: An improved integrated model

Computers and Industrial Engineering
Cost efficiency analysis with ordinal data: a theoretical and computational view

International Journal of Computer Mathematics
A robust optimization approach for imprecise data envelopment analysis

Computers and Industrial Engineering
Minimizing deviations of input and output weights from their means in data envelopment analysis

Computers and Industrial Engineering
A bargaining game model for efficiency decomposition in the centralized model of two-stage systems

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.