Generalizing cross redundancy in data envelopment analysis

DOI10.1016/j.ejor.2011.05.020zbMath1219.90080OpenAlexW1997677395MaRDI QIDQ635185

Francisco J. López

Publication date: 19 August 2011

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.05.020

zbMATH Keywords

data envelopment analysisDEAcross redundancy

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 (1)

Determining radial efficiency with a large data set by solving small-size linear programs

Cites Work

• Measuring the efficiency of decision making units
• Streamlined computation for data envelopment analysis
• A computational study of DEA with massive data sets
• Preprocessing DEA
• Estimation of returns to scale using data envelopment analysis
• A note on returns to scale in DEA
• A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
• Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
• Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
• An Algorithm for Data Envelopment Analysis
• An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
• Comparisons and evaluations of alternative approaches to the treatment of congestion in DEA

This page was built for publication: Generalizing cross redundancy in data envelopment analysis