A New Representation of Efficient Point Sets and Its Applications in DEA

Abstract EN

E ( M , K ) ( E w ( M , K ) ) , the set of Pareto efficient (weak efficient) points of a set M with respect to a cone K in Rn, is expressed as a differencebetweentwo sets M and M+K∖{0} (M and M+intK).

Using the new representation, the properties of E(M,K) are proved more easily than before.

When M or K is in the form of union, intersection, sum, or difference of two sets or two cones, respectively, the properties of E(M,K) are considered.

Most of the properties are proved by the binary operations of sets, which is a new method in the multiobjective optimization.

Then these properties are used to solve some types of multiobjective linear programming problems corresponding to Data Envelopment Analysis (DEA) models.

The structures of the DEA efficient solution sets of four most representative DEA models are developed.

Further more, the relationships between efficiencies of the four DEA models are deduced.