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

DOI10.1016/j.amc.2004.04.111zbMath1123.90339OpenAlexW2053783850MaRDI QIDQ556092

Jianyong Qiao, Sumit K. Garg

Publication date: 13 June 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.04.111

zbMATH Keywords

Data envelopment analysisNon-Archimedean infinitesimal Epsilon

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (5)

Recognizing the efficiency, weak efficiency and inefficiency of DMUs with an epsilon independent linear program ⋮ Model improvement for computational difficulties of DEA technique in the presence of special DMUs ⋮ Crowding distance development for ranking efficient units in DEA ⋮ Solving DEA models in a single optimization stage: can the non-Archimedean infinitesimal be replaced by a small finite epsilon? ⋮ The role of multiplier bounds in fuzzy data envelopment analysis

Uses Software

• DEA

Cites Work

• Unnamed Item
• Unnamed Item
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• Classifying and characterizing efficiencies and inefficiencies in data development analysis
• A polynomial-time algorithm for finding \(\varepsilon\) in DEA models
• Computational Accuracy and Infinitesimals In Data Envelopment Analysis
• AN ε-FREE DEA AND A NEW MEASURE OF EFFICIENCY

This page was built for publication: The overall assurance interval for the non-Archimedean epsilon in DEA models; a partition base algorithm