Journal
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
Volume 29, Issue 2, Pages -Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S021759591250011X
Keywords
Data envelopment analysis (DEA); linear bilevel programming (LBP); minimum distance; strong efficient frontier; closest targets
Categories
Ask authors/readers for more resources
Data envelopment analysis (DEA) can be used for assessing the relative efficiency of a number of operating units, finding, for each unit, a target operating point lying on the strong efficient frontier. Most DEA models project an inefficient unit onto a most distant target, which makes its attainment more difficult. In this paper, a linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier by different norms is provided. The idea behind this approach is that closer targets determine less demanding levels of operation for the inputs and outputs of the units to perform efficiently. Finally, it will be shown that the proposed method is an extension of the existing methods.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available