Identifying the anchor points in DEA using sensitivity analysis in linear programming

DOI10.1016/j.ejor.2014.02.046zbMath1304.90141OpenAlexW2070484574MaRDI QIDQ2514838

Amin Mostafaee, Majid Soleimani-damaneh

Publication date: 4 February 2015

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

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

zbMATH Keywords

linear programmingextreme pointsensitivity analysisdata envelopment analysisanchor point

Mathematics Subject Classification ID

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

Related Items

Identification of the anchor points in FDH models, Unnamed Item, On comparison of different sets of units used for improving the frontier in DEA models, Some Conditions for Characterizing Anchor Points, Anchor points in multiobjective optimization: definition, characterization and detection, The role of hyperplanes for characterizing suspicious units in DEA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving envelopment in data envelopment analysis under variable returns to scale
• Scale elasticity and returns to scale in the presence of alternative solutions
• Anchor points in DEA
• Improving envelopment in data envelopment analysis.
• Measuring super-efficiency in DEA in the presence of infeasibility
• A comment on ``Measuring super-efficiency in DEA in the presence of infeasibility
• Simulating Weights Restrictions in Data Envelopment Analysis by Means of Unobserved DMUs
• Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
• A Procedure for Ranking Efficient Units in Data Envelopment Analysis
• Nonparametric frontier analysis with multiple constituencies
• A slacks-based measure of efficiency in data envelopment analysis