Scale efficiency in two-stage network DEA

Kun Chen and Joe Zhu

Journal of the Operational Research Society, 2019, vol. 70, issue 1, 101-110

Abstract: Network data envelopment analysis (DEA) considers internal structures of decision-making units. Unlike the standard DEA, network DEA imposes hurdles for measuring scale efficiency due to the fact that (i) overall efficiency aggregated by the stage or divisional technical efficiencies is highly non-linear and only solvable in a heuristic manner, or (ii) the overall efficiency which concerns exclusively inputs and outputs of a system is difficult to be decomposed into divisional efficiencies. In this paper, we establish a mathematical transformation to convert the corresponding non-linear programming problem into second order cone programming programme. The transformation is shown to be versatile in dealing with both constant returns to scale and variable returns to scale models under the two-stage network DEA. Meanwhile, our numerical results reveal that overall scale efficiency in two-stage network DEA is consistent with scale efficiency in conventional DEA.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2017.1421850 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:70:y:2019:i:1:p:101-110

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2017.1421850

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().