Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming

From MaRDI portal
Publication:1926834


DOI10.1016/j.ejor.2012.02.035zbMath1253.90171MaRDI QIDQ1926834

Hirofumi Fukuyama, Kazuyuki Sekitani

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.02.035


90C11: Mixed integer programming

90B30: Production models

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)


Related Items



Cites Work