IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v29y2012i02ns021759591250011x.html
   My bibliography  Save this article

A Linear Bilevel Programming Problem For Obtaining The Closest Targets And Minimum Distance Of A Unit From The Strong Efficient Frontier

Author

Listed:
  • 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;
    Faculty of Mathematical and Computer Sciences, Teacher Training University, 599 Taleghani Avenue, 15618 Tehran, Iran)

  • M. ZAREPISHEH

    (Faculty of Mathematical Sciences and Computer, Amirkabir University, Tehran, Iran)

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.

Suggested Citation

  • G. R. Jahanshahloo & J. Vakili & M. Zarepisheh, 2012. "A Linear Bilevel Programming Problem For Obtaining The Closest Targets And Minimum Distance Of A Unit From The Strong Efficient Frontier," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 29(02), pages 1-19.
    • Handle: RePEc:wsi:apjorx:v:29:y:2012:i:02:n:s021759591250011x
    DOI: 10.1142/S021759591250011X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759591250011X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759591250011X?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. J. Vakili & R. Sadighi Dizaji, 2021. "The closest strong efficient targets in the FDH technology: an enumeration method," Journal of Productivity Analysis, Springer, vol. 55(2), pages 91-105, April.
    2. Lozano, Sebastián & Khezri, Somayeh, 2021. "Network DEA smallest improvement approach," Omega, Elsevier, vol. 98(C).
    3. Javad Vakili & Hanieh Amirmoshiri & Rashed Khanjani Shiraz & Hirofumi Fukuyama, 2020. "A modified distance friction minimization approach in data envelopment analysis," Annals of Operations Research, Springer, vol. 288(2), pages 789-804, May.
    4. Aparicio, Juan & Pastor, Jesus T., 2014. "Closest targets and strong monotonicity on the strongly efficient frontier in DEA," Omega, Elsevier, vol. 44(C), pages 51-57.
    5. Mustapha Daruwana Ibrahim & Sahand Daneshvar & Hüseyin Güden & Bela Vizvari, 2020. "Target setting in data envelopment analysis: efficiency improvement models with predefined inputs/outputs," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1319-1336, December.
    6. Ling Wang & Zhongchang Chen & Dalai Ma & Pei Zhao, 2013. "Measuring Carbon Emissions Performance in 123 Countries: Application of Minimum Distance to the Strong Efficiency Frontier Analysis," Sustainability, MDPI, vol. 5(12), pages 1-14, December.
    7. Somayeh Razipour-GhalehJough & Farhad Hosseinzadeh Lotfi & Gholamreza Jahanshahloo & Mohsen Rostamy-malkhalifeh & Hamid Sharafi, 2020. "Finding closest target for bank branches in the presence of weight restrictions using data envelopment analysis," Annals of Operations Research, Springer, vol. 288(2), pages 755-787, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:29:y:2012:i:02:n:s021759591250011x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.