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

Obtaining all extreme rays of a special cone using spanning trees in a complete digraph: Application in DEA

Author

Listed:
  • Najmeh Malekmohammadi
  • Amin Mostafaee

Abstract

This paper presents a new method which can be used in two different situations: Firstly, for converting certain polyhedral cones of intersection form to cones of sum form, this method identifies all the extreme rays of a cone of intersection form by enumerating all spanning trees in a complete digraph without solving any mathematical programming problems. Secondly, in the existing data envelopment analysis models, the lower bound of cost efficiency measure can be calculated by using weights restrictions in the form of input cone assurance region. In such cases, all vertices are obtained by enumerating all potential bases. In fact, for determining the lower bound of cost efficiency measure, the vertices of a polyhedral set should be calculated. Because obtaining all vertices by enumerating all potential bases is not actually affordable, in this paper we obtain the vertices by enumerating all spanning trees in a complete digraph. This method has computational advantages over the previous ones. At the end of this paper, two numerical examples are provided to demonstrate the advantage of the proposed method.

Suggested Citation

  • Najmeh Malekmohammadi & Amin Mostafaee, 2018. "Obtaining all extreme rays of a special cone using spanning trees in a complete digraph: Application in DEA," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(5), pages 762-771, May.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:5:p:762-771
    DOI: 10.1057/s41274-017-0265-9
    as

    Download full text from publisher

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

    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:69:y:2018:i:5:p:762-771. 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.