The overall assurance interval for the non-Archimedean Epsilon in DEA models; a partition base algorithm

摘要

This study presents an algorithm for determining overall assurance interval of Epsilon in DEA models. In the previous studies in this regard, solving n linear programs are needed for this propose, where n is the number of decision making units (DMU) involved in the evaluation. This paper, based on a classification of DMU’s, proposes a partition base algorithm that can determine the overall assurance interval of Epsilon by solving a few number of linear programs. The proposed algorithm is illustrated by the 44 unit data set of Power Plant Systems of Iran.