Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming
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
efficient frontierdata envelopment analysis (DEA)mixed integer programming (MIP)maximal efficient face
Mixed integer programming (90C11) Production models (90B30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
- Measuring the efficiency of decision making units
- Choosing weights from alternative optimal solutions of dual multiplier models in DEA
- Valid inequalities for mixed integer linear programs
- A multi-stage methodology for the solution of orientated DEA models
- Measurements of simultaneous scale and mix changes in inputs and outputs using DEA facets and RTS
- Estimating output gains by means of Luenberger efficiency measures
- The relevance of DEA benchmarking information and the least-distance measure
- A pareto race
- Indicators of Ill-Conditioned Data Sets and Model Misspecification in Data Envelopment Analysis: An Extended Facet Approach
- On measuring the inefficiency with the inner-product norm in data envelopment analysis
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