Computational accuracy and infinitesimals in data envelopment analysis

The role of the non-Archimedean construct • in the CCR and BCC models is clarified. It is established that the associated dual linear programs can be infeasible (for the multiplier side) and unbounded (for the associated dual envelopment side program). Sufficient conditions are established for feasibility and boundedness. Computational testing indicates that improper selection of a value for • can result in serious errors. The importance of the results for DEA practitioners and the serious consequences of misclassification are discussed.