Anchor points in DEA

DOI10.1016/j.ejor.2007.10.034zbMath1157.90435OpenAlexW2070095139MaRDI QIDQ1011200

José H. Dulá, Marie-Laure Bougnol

Publication date: 8 April 2009

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

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

zbMATH Keywords

linear programmingdata envelopment analysisconvex analysisefficient and inefficient boundary

Mathematics Subject Classification ID

Linear programming (90C05) Management decision making, including multiple objectives (90B50)

Related Items (18)

Parallel processing of the Build Hull algorithm to address the large-scale DEA problem ⋮ Identification of the anchor points in FDH models ⋮ Inverse DEA with frontier changes for new product target setting ⋮ Technological returns to scale: Identification and visualization ⋮ Identifying suspicious efficient units in DEA models ⋮ Improving envelopment in data envelopment analysis under variable returns to scale ⋮ Unnamed Item ⋮ Improving the frontier in DEA models ⋮ On comparison of different sets of units used for improving the frontier in DEA models ⋮ Interior point methods in DEA to determine non-zero multiplier weights ⋮ Measuring efficiency in imperfectly competitive markets: an example of rational inefficiency ⋮ Measuring the smoothness of the DEA frontier ⋮ Strong, weak and Farrell efficient frontiers of technologies satisfying different production assumptions ⋮ Identifying the anchor points in DEA using sensitivity analysis in linear programming ⋮ Some Conditions for Characterizing Anchor Points ⋮ The other side of ranking schemes: generating weights for specified outcomes ⋮ Anchor points in multiobjective optimization: definition, characterization and detection ⋮ The role of hyperplanes for characterizing suspicious units in DEA

Cites Work

• Validating DEA as a ranking tool: an application of DEA to assess performance in higher education
• Improving envelopment in data envelopment analysis.
• Simulating Weights Restrictions in Data Envelopment Analysis by Means of Unobserved DMUs
• Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
• Indicators of Ill-Conditioned Data Sets and Model Misspecification in Data Envelopment Analysis: An Extended Facet Approach
• Radii of Classification Preservation in Data Envelopment Analysis: a Case Study of ‘Program Follow-Through’

This page was built for publication: Anchor points in DEA