A LINEAR BILEVEL PROGRAMMING PROBLEM FOR OBTAINING THE CLOSEST TARGETS AND MINIMUM DISTANCE OF A UNIT FROM THE STRONG EFFICIENT FRONTIER

G. R. Jahanshahloo (), J. Vakili () and M. Zarepisheh ()
Additional contact information
G. R. Jahanshahloo: Faculty of Mathematical and Computer Sciences, Teacher Training University, 599 Taleghani Avenue, 15618 Tehran, Iran
J. Vakili: Faculty of Mathematical Sciences and Computer, Tabriz University, 29 Bahman Avenue, Tabriz, Iran;
M. Zarepisheh: Faculty of Mathematical Sciences and Computer, Amirkabir University, Tehran, Iran

Asia-Pacific Journal of Operational Research (APJOR), 2012, vol. 29, issue 02, 1-19

Abstract: 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.

Keywords: Data envelopment analysis (DEA); linear bilevel programming (LBP); minimum distance; strong efficient frontier; closest targets (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S021759591250011X
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:29:y:2012:i:02:n:s021759591250011x

Ordering information: This journal article can be ordered from

DOI: 10.1142/S021759591250011X

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().