A new MIP approach on the least distance problem in DEA

DOI10.1142/S021759592050027XMaRDI QIDQ5149538zbMATH OpenOpenAlexFDO

Authors

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

closest efficient targetdata envelopment analysisleast distance problemlinear complementarity conditions

Mathematics Subject Classification ID

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

Recommendations

• A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier
• Determining closest targets on the extended facet production possibility set in data envelopment analysis: modeling and computational aspects
• scientific article; zbMATH DE number 7340807
• Input-output substitutability and strongly monotonic p-norm least distance DEA measures
• Finding target units in FDH model by least-distance measure model

Cites work

• A comment on multi-stage DEA methodology
• A Euclidean distance-based measure of efficiency in data envelopment analysis
• A mixed integer programming approach for the minimum maximal flow
• A multi-stage methodology for the solution of orientated DEA models
• A slacks-based measure of efficiency in data envelopment analysis
• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 3069614 (Why is no real title available?)
• Input-output substitutability and strongly monotonic p-norm least distance DEA measures
• Least distance based inefficiency measures on the Pareto-efficient frontier in DEA
• Mathematical Programs with Equilibrium Constraints
• Measuring the efficiency of decision making units
• Monotonicity of minimum distance inefficiency measures for data envelopment analysis
• New models for computing the distance of DMUs to the weak efficient boundary of convex and nonconvex PPSs in DEA
• On how to properly calculate the Euclidean distance-based measure in DEA
• Solving mathematical programs with complementarity constraints as nonlinear programs
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis

Cited in

(8)

• On finding the most BCC-efficient DMU: a new integrated MIP-DEA model
• Determining closest targets on the extended facet production possibility set in data envelopment analysis: modeling and computational aspects
• Finding target units in FDH model by least-distance measure model
• 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
• Input-output substitutability and strongly monotonic p-norm least distance DEA measures
• Least-Distance Range Adjusted Measure in DEA: Efficiency Evaluation and Benchmarking for Japanese Banks
• Least-distance approach for efficiency analysis: a framework for nonlinear DEA models

Describes a project that uses

Uses Software

• MacMPEC

This page was built for publication: A new MIP approach on the least distance problem in DEA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149538)