A compromise programming approach for target setting in DEA

Abstract

This paper presents a new data envelopment analysis (DEA) target setting approach that uses the compromise programming (CP) method of multiobjective optimization. This method computes the ideal point associated to each decision making unit (DMU) and determines an ambitious, efficient target that is as close as possible (using an lp metric) to that ideal point. The specific cases p = 1, p = 2 and p = ∞ are separately discussed and analyzed. In particular, for p = 1 and p = ∞, a lexicographic optimization approach is proposed in order to guarantee uniqueness of the obtained target. The original CP method is translation invariant and has been adapted so that the proposed CP-DEA is also units invariant. An lp metric-based efficiency score is also defined for each DMU. The proposed CP-DEA approach can also be utilized in the presence of preference information, non-discretionary or integer variables and undesirable outputs. The proposed approach has been extensively compared with other DEA approaches on a dataset from the literature.