Name
Title | ||
|---|---|---|
A conic relaxation model for searching for the global optimum of network data envelopment analysis. |
Abstract | ||
|---|---|---|
•A conic relaxation model is established for network data envelopment analysis.•Finite McCormick envelopes are ensured to enable the establishment.•Unnecessary linear relaxations of nonlinear constraints are avoided.•Tighter bounds of global-optimal overall efficiency are generated.•Distances between the global-optimal solution and its approximations are estimated. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ejor.2019.07.012 | European Journal of Operational Research |
Keywords | Field | DocType |
Data envelopment analysis,Network,Conic relaxation,McCormick envelopes,Linear relaxation | Second-order cone programming,Branch and bound,Mathematical optimization,Nonlinear system,Envelopment,Multiplier (economics),Conic section,Optimization problem,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
280 | 1 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kun Chen | 1 | 0 | 0.34 |
| Wade D. Cook | 2 | 1215 | 84.70 |
| Joe Zhu | 3 | 1762 | 167.31 |