Abstract
In network data envelopment analysis (DEA) literature, the general multiplicative two-stage network model, where the objective function is the product of the two stage efficiency ratios, is highly nonlinear and is impossible to be directly transformed into linear programming problems. Chen and Zhu (2017) discovered that this model corresponds to a cone-type structure and can be transformed into a second order cone programming (SOCP) problem with a parameter. The transformed parametric SOCP problem is solved by computing a series of SOCP models when the parameter is varied. We show that Chen and Zhu's (2017) model can be directly transformed into a single SOCP problem, without the need for solving parametric SOCP problems. This greatly reduces the computational burden.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
