A New MIP Approach on the Least Distance Problem in DEA

DOI10.1142/S021759592050027XzbMath1459.90134OpenAlexW3024074291MaRDI QIDQ5149538

No author found.

Publication date: 11 February 2021

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021759592050027x

zbMATH Keywords

data envelopment analysisleast distance problemlinear complementarity conditionsclosest efficient target

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11)

Related Items (1)

Least-Distance Range Adjusted Measure in DEA: Efficiency Evaluation and Benchmarking for Japanese Banks

Uses Software

• MacMPEC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• Input-output substitutability and strongly monotonic \(p\)-norm least distance DEA measures
• A multi-stage methodology for the solution of orientated DEA models
• Monotonicity of minimum distance inefficiency measures for data envelopment analysis
• LEAST DISTANCE BASED INEFFICIENCY MEASURES ON THE PARETO-EFFICIENT FRONTIER IN DEA
• 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
• Solving mathematical programs with complementarity constraints as nonlinear programs
• On how to properly calculate the Euclidean distance-based measure in DEA
• Mathematical Programs with Equilibrium Constraints
• A slacks-based measure of efficiency in data envelopment analysis
• A comment on multi-stage DEA methodology

This page was built for publication: A New MIP Approach on the Least Distance Problem in DEA