Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology

DOI10.5269/bspm.51654OpenAlexW4313579276MaRDI QIDQ6154646

Unnamed Author, Javad Vakili

Publication date: 16 February 2024

Published in: Boletim da Sociedade Paranaense de Matemática (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5269/bspm.51654

zbMATH Keywords

data envelopment analysis (DEA)closest targets free disposal hull (FDH)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• A distance friction minimization approach in data envelopment analysis: a comparative study on airport efficiency
• A multi-stage methodology for the solution of orientated DEA models
• Estimating returns to scale using non-parametric deterministic technologies: A new method based on goodness-of-fit
• USING THE MINIMUM DISTANCE OF DMUs FROM THE FRONTIER OF THE PPS FOR EVALUATING GROUP PERFORMANCE OF DMUs IN DEA
• A LINEAR BILEVEL PROGRAMMING PROBLEM FOR OBTAINING THE CLOSEST TARGETS AND MINIMUM DISTANCE OF A UNIT FROM THE STRONG EFFICIENT FRONTIER
• A Euclidean distance-based measure of efficiency in data envelopment analysis
• New Models for Computing the Distance of DMUs to the Weak Efficient Boundary of Convex and Nonconvex PPSs in DEA

This page was built for publication: Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology