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

USING THE MINIMUM DISTANCE OF DMUs FROM THE FRONTIER OF THE PPS FOR EVALUATING GROUP PERFORMANCE OF DMUs IN DEA

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)

  • S. M. MIRDEHGHAN

    (Faculty of Mathematics, Shiraz University, Shiraz, Iran)

Abstract

Evaluating group performance of decision-making units (DMUs) is an application of data envelopment analysis (DEA) and usually provides a measure to compare the frontiers of the production possibility sets (PPSs) corresponding to different groups and the internal inefficiencies of DMUs associated with their group. In this paper, first, a method is presented for obtaining the minimum distance of DMUs from the frontier of the PPS by ‖⋅‖1, which itself can be a very important subject in DEA, and then, for stating an application of these distances, an approach is provided for evaluating group performance of DMUs based on the production ability of the PPSs such that both constant and variable returns to scale assumptions can be used in this method in contrast with some other methods. Therefore, providing the methods for both obtaining the minimum distance of DMUs from the frontier of the PPS and evaluating group performance of DMUs is the most important contribution of this paper.

Suggested Citation

  • G. R. Jahanshahloo & J. Vakili & S. M. Mirdehghan, 2012. "USING THE MINIMUM DISTANCE OF DMUs FROM THE FRONTIER OF THE PPS FOR EVALUATING GROUP PERFORMANCE OF DMUs IN DEA," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 29(02), pages 1-25.
    • Handle: RePEc:wsi:apjorx:v:29:y:2012:i:02:n:s0217595912500108
    DOI: 10.1142/S0217595912500108
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595912500108
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595912500108?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. 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.
    3. J. Vakili, 2017. "New Models for Computing the Distance of DMUs to the Weak Efficient Boundary of Convex and Nonconvex PPSs in DEA," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(06), pages 1-20, December.
    4. Ando, Kazutoshi & Minamide, Masato & Sekitani, Kazuyuki & Shi, Jianming, 2017. "Monotonicity of minimum distance inefficiency measures for Data Envelopment Analysis," European Journal of Operational Research, Elsevier, vol. 260(1), pages 232-243.
    5. 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.
    6. 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:s0217595912500108. 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.