![A polynomial-time algorithm for finding @e in DEA models [An article from: Computers and Operations Research]](https://www.ebooknetworking.net/books/B00/0RR/bigB000RR16Y0.jpg)
A polynomial-time algorithm for finding @e in DEA models [An article from: Computers and Operations Research]
Book Details
Author(s)G.R. Amin, M. Toloo
PublisherElsevier
ISBN / ASINB000RR16Y0
ISBN-13978B000RR16Y3
MarketplaceFrance 🇫🇷
Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
This paper presents a new algorithm for computing the non-Archimedean @e 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 @e 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.
Description:
This paper presents a new algorithm for computing the non-Archimedean @e 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 @e 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.
