Solving DEA models in a single optimization stage: can the non-Archimedean infinitesimal be replaced by a small finite epsilon?

DOI10.1016/j.ejor.2016.09.022zbMath1394.90427MaRDI QIDQ1752817

Tatiana Bouzdine-Chameeva, Victor V. Podinovski

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://dspace.lboro.ac.uk/2134/22659

zbMATH Keywords

data envelopment analysis; effective bound; single-stage optimization

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B50: Management decision making, including multiple objectives

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Related Items

Efficiency assessment using a multidirectional DDF approach, Refined bounds for the non-Archimedean \(\epsilon\) in DEA, Identification of congestion in data envelopment analysis under the occurrence of multiple projections: a reliable method capable of dealing with negative data, Multiplicative aggregation of division efficiencies in network data envelopment analysis, New data envelopment analysis models for classifying flexible measures: the role of non-Archimedean epsilon, An epsilon-based data envelopment analysis approach for solving performance measurement problems with interval and ordinal dual-role factors, New common set of weights method in black-box and two-stage data envelopment analysis

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
• Consistent weight restrictions in data envelopment analysis
• Optimal weights in DEA models with weight restrictions
• The overall assurance interval for the non-Archimedean epsilon in DEA models; a partition base algorithm
• An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models
• A polynomial-time algorithm for finding \(\varepsilon\) in DEA models
• An efficient approach for computing non-Archimedean \(\varepsilon\) in DEA based on integrated models
• The explicit role of weight bounds in models of data envelopment analysis
• Continuity of DEA Efficiency Measures
• Non-archimedean infinitesimals, transcendentals and categorical inputs in linear programming and data envelopment analysis
• Computational Accuracy and Infinitesimals In Data Envelopment Analysis
• Production trade-offs and weight restrictions in data envelopment analysis
• Weight Restrictions and Free Production in Data Envelopment Analysis