A modified distance friction minimization approach in data envelopment analysis
Javad Vakili (),
Hanieh Amirmoshiri (),
Rashed Khanjani Shiraz () and
Hirofumi Fukuyama ()
Additional contact information
Javad Vakili: University of Tabriz
Hanieh Amirmoshiri: University of Tabriz
Rashed Khanjani Shiraz: University of Tabriz
Hirofumi Fukuyama: Fukuoka University
Annals of Operations Research, 2020, vol. 288, issue 2, No 11, 789-804
Abstract A multi-step distance friction minimization (DFM) approach has been developed to assist a decision making unit to improve its efficiency. This approach contracts inputs and expands outputs simultaneously through the minimization of distance friction relative to the strongly efficient frontier based on a weighted Euclidean norm. In this paper, we point out that the DFM approach has a problem by means of two numerical examples and then show how to solve the problem. Using a real data set, we not only confirm the occurrence of this problem inherent in the original formulation, but also demonstrate how our modification works.
Keywords: Data envelopment analysis (DEA); Decision making unit (DMU); Projection; Distance friction minimization (DFM) (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10479-019-03232-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:288:y:2020:i:2:d:10.1007_s10479-019-03232-z
Ordering information: This journal article can be ordered from
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla ().