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

From MaRDI portal
Revision as of 16:10, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1926834

DOI10.1016/j.ejor.2012.02.035zbMath1253.90171OpenAlexW2013137668MaRDI 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




Related Items (7)



Cites Work


This page was built for publication: Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming