A linear programming approach to efficiency evaluation in nonconvex metatechnologies

The notions of metatechnology and metafrontier arise in applications of data envelopment analysis (DEA) in which decision making units (DMUs) are not sufficiently homogeneous to be considered as operating in the same technology. In this case, DMUs are partitioned into different groups, each operating in the same technology. In contrast, the metatechnology includes all DMUs and represents all production possibilities that can in principle be achieved in different production environments. Often, the metatechnology cannot be assumed to be a convex set. In such cases benchmarking a DMU against the common metafrontier requires implementing either an enumeration algorithm and solving a linear program at each of its steps, or solving an equivalent mixed integer linear program. In this paper we show that the same task can be accomplished by solving a single linear program. We also show that its dual can be used for the returns-to-scale characterization of efficient DMUs on the metafrontier.