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

Multistage network data envelopment analysis: Semidefinite programming approach

Author

Listed:
  • Linyan Zhang
  • Chuanyin Guo
  • Fajie Wei

Abstract

Additive efficiency aggregation is one of the important techniques measuring the relative efficiency of decision-making units under network data envelopment analysis (DEA). However, the modelling of additive network DEA is limited to parametric methods to approximate optimal solutions in previous literature. Under multistage network structure, if some outputs leave the system from a given stage while others become inputs to the next stage and some new inputs enter at any stage, the additive network models become extremely nonlinear and are impossible to be solved by linear program. The current paper proposes to solve general additive two-stage models by using semidefinite programming, which is known as effective as linear program. We then extend the methodology to general multistage network structures (including serial processes, parallel processes, multistage processes with non-immediate successor flows, and multistage processes with feedbacks). A numerical data set and the case of regional R&D processes in China are revisited by using the newly developed approach.

Suggested Citation

  • Linyan Zhang & Chuanyin Guo & Fajie Wei, 2019. "Multistage network data envelopment analysis: Semidefinite programming approach," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(8), pages 1284-1295, August.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:8:p:1284-1295
    DOI: 10.1080/01605682.2018.1489348
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1489348
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1489348?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:70:y:2019:i:8:p:1284-1295. 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.