A polynomial-time algorithm for finding ε in DEA models

Gholam R. Amin; Mehdi Toloo

doi:10.1016/S0305-0548(03)00072-8

A polynomial-time algorithm for finding ε in DEA models

Gholam R. Amin^*, Mehdi Toloo

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

75 Citations (SciVal)

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.

Original language	English
Pages (from-to)	803-805
Number of pages	3
Journal	Computers and Operations Research
Volume	31
Issue number	5
DOIs	https://doi.org/10.1016/S0305-0548(03)00072-8
Publication status	Published - Apr 2004
Externally published	Yes

Keywords

Data envelopment analysis
Non-Archimedean ε
Polynomial time algorithm

ASJC Scopus subject areas

Computer Science(all)
Modelling and Simulation
Management Science and Operations Research

Access to Document

10.1016/S0305-0548(03)00072-8

Cite this

@article{009cdd0c675b4c88a1e1326336caa33c,

title = "A polynomial-time algorithm for finding ε in DEA models",

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.",

keywords = "Data envelopment analysis, Non-Archimedean ε, Polynomial time algorithm",

author = "Amin, {Gholam R.} and Mehdi Toloo",

year = "2004",

month = apr,

doi = "10.1016/S0305-0548(03)00072-8",

language = "English",

volume = "31",

pages = "803--805",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Limited",

number = "5",

}

TY - JOUR

T1 - A polynomial-time algorithm for finding ε in DEA models

AU - Amin, Gholam R.

AU - Toloo, Mehdi

PY - 2004/4

Y1 - 2004/4

N2 - 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.

AB - 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.

KW - Data envelopment analysis

KW - Non-Archimedean ε

KW - Polynomial time algorithm

UR - http://www.scopus.com/inward/record.url?scp=0942301996&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0942301996&partnerID=8YFLogxK

U2 - 10.1016/S0305-0548(03)00072-8

DO - 10.1016/S0305-0548(03)00072-8

M3 - Article

AN - SCOPUS:0942301996

SN - 0305-0548

VL - 31

SP - 803

EP - 805

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 5

ER -

A polynomial-time algorithm for finding ε in DEA models

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this