Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming
type: Item
instance of: scholarly article
title: Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming
zbMATH Open document ID: 1253.90171
author: Hirofumi Fukuyama
author: Kazuyuki Sekitani
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6119434
zbMATH Keywords: data envelopment analysis (DEA)
zbMATH Keywords: mixed integer programming (MIP)
zbMATH Keywords: maximal efficient face
zbMATH Keywords: efficient frontier
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.02.035
OpenAlex ID: W2013137668
cites work: Measurements of simultaneous scale and mix changes in inputs and outputs using DEA facets and RTS
cites work: The relevance of DEA benchmarking information and the least-distance measure
cites work: Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
cites work: Measuring the efficiency of decision making units
cites work: A multi-stage methodology for the solution of orientated DEA models
cites work: Choosing weights from alternative optimal solutions of dual multiplier models in DEA
cites work: Estimating output gains by means of Luenberger efficiency measures
cites work: Valid inequalities for mixed integer linear programs
cites work: A pareto race
cites work: Q5589748
cites work: Indicators of Ill-Conditioned Data Sets and Model Misspecification in Data Envelopment Analysis: An Extended Facet Approach
cites work: Q4826095
cites work: On measuring the inefficiency with the inner-product norm in data envelopment analysis
DOI: 10.1016/J.EJOR.2012.02.035
description: scientific article; zbMATH DE number 6119434