A polynomial-time algorithm for finding ϵ in data envelopment analysis models

A polynomial-time algorithm for finding ϵ in data envelopment analysis models

0.00 Avg rating0 Votes
Article ID: iaor20043386
Country: United Kingdom
Volume: 31
Issue: 5
Start Page Number: 803
End Page Number: 805
Publication Date: Apr 2004
Journal: Computers and Operations Research
Authors: ,
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.

Reviews

Required fields are marked *. Your email address will not be published.