IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v76y2025i10p2150-2168.html
   My bibliography  Save this article

Closest targets in Russell graph measure of strongly monotonic efficiency for an extended facet production possibility set

Author

Listed:
  • Kazuyuki Sekitani
  • Yu Zhao

Abstract

The Russell graph measure is a non-radial efficiency measure for non-oriented Data Envelopment Analysis (DEA) models. It is strongly monotonic, but its projection point is not the closest one. Prior studies attempted to reverse the optimization of DEA models from a minimization problem to a maximization one for finding closer targets; however, this modification fails to satisfy strengthen the monotonicity of he efficiency measure. To resolve the conflict between the closer targets and strong monotonicity of efficiency measures, this study proposes a maximum Russell graph measure DEA model based on an extended facet production possibility set. It provides the closest target with only a single improvement in either an output or input term for the assessed DMU and avoids the free-lunch issue. Moreover, the maximum Russell graph measure satisfies strong monotonicity. Further practical advantages of the proposed efficiency measure are demonstrated numerically in comparison to other existing non-radial efficiency measures.

Suggested Citation

  • Kazuyuki Sekitani & Yu Zhao, 2025. "Closest targets in Russell graph measure of strongly monotonic efficiency for an extended facet production possibility set," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 76(10), pages 2150-2168, October.
    • Handle: RePEc:taf:tjorxx:v:76:y:2025:i:10:p:2150-2168
    DOI: 10.1080/01605682.2025.2460617
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2025.2460617
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2025.2460617?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

    for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:76:y:2025:i:10:p:2150-2168. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.