Abstract

A problem of increasing the efficiencies of inefficient decision-making units (DMUs) with known marginal costs of reducing inputs is considered. It is shown that the problem is difficult to solve exactly, and has exponential computational complexity. Two heuristics (Heuristic-I and Heuristic-II) that consider cost minimizing DEA frontier projections for inefficient DMUs are proposed. The proposed heuristics are tested by using several simulated and real-world datasets with linear and Fibonacci marginal input reduction costs. The results of the proposed heuristics are compared with traditional cost insensitive DEA frontier projections, and it is shown that Heuristic-I results in approximately 18–58% lower costs.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.