A conic relaxation model for searching for the global optimum of network data envelopment analysis
Year of publication: |
2020
|
---|---|
Authors: | Chen, Kun ; Cook, Wade D. ; Zhu, Joe |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 280.2020, 1 (1.1.), p. 242-253
|
Subject: | Conic relaxation | Data envelopment analysis | Linear relaxation | McCormick envelopes | Network | Data-Envelopment-Analyse | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Cone ratio models with shared resources and nontransparent allocation parameters in network DEA
Ding, Jingjing, (2015)
-
Hierarchical network systems : an application to high-technology industry in China
Zhang, Linyan, (2019)
-
Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster
Chandra, Saurabh, (2021)
- More ...
-
Using Operational and Stock Analytics to Measure Airline Performance : A Network DEA Approach
Zhang, Qian, (2019)
-
Computational tractability of chance constrained data envelopment analysis
Chen, Kun, (2019)
-
Additive slacks-based measure : computational strategy and extension to network DEA
Chen, Kun, (2020)
- More ...