Profit, directional distance functions, and Nerlovian efficiency
Journal of Optimization Theory and Applications
Data Envelopment Analysis: Theory, Methodology and Application
Data Envelopment Analysis: Theory, Methodology and Application
An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
INFORMS Journal on Computing
Data envelopment analysis (DEA) in massive data sets
Handbook of massive data sets
Data Envelopment Analysis: A Comprehensive Text with Models, Applications, References and DEA-Solver Software
A dimensional decomposition approach to identifying efficient units in large-scale DEA models
Computers and Operations Research
Competing output-sensitive frame algorithms
Computational Geometry: Theory and Applications
Hi-index | 0.01 |
In this paper, we propose the use of lexicographic parametric programming to recognize efficient units in data envelopment analysis (DEA). By using the parameterization of the right-hand side vector of the envelopment problem, we obtain the efficiency curve which is traversing through the efficient frontier from unit to unit. The units in the basis with any parameter value are efficient and the unit dominated by a point on an efficient facet is inefficient. Lexicographic parametric programming is needed to guarantee that all units to be considered are efficient-not only weakly efficient.