A polynomial-time algorithm for finding ε in DEA models

Gholam R. Amin*, Mehdi Toloo

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

73 Citations (Scopus)

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 languageEnglish
Pages (from-to)803-805
Number of pages3
JournalComputers and Operations Research
Volume31
Issue number5
DOIs
Publication statusPublished - Apr 2004
Externally publishedYes

Keywords

  • Data envelopment analysis
  • Non-Archimedean ε
  • Polynomial time algorithm

ASJC Scopus subject areas

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

Cite this