The solution of super-scale DEA models based on preference character

The basic relationships and intrinsic laws in the data envelopment analysis (DEA) are the basis for designing fast solutions for big data DEA models. By delving into these relationships, it becomes feasible to address super-scale DEA problems more swiftly, aligning with the need for timeliness in real-world efficiency evaluations and reducing time costs. This paper leverages the intrinsic characteristics of DEA to formulate a DEA model scale reduction approach, offering reliable theoretical support for solving super- scale DEA problems. Initially, the partially ordered set theory to prove the relationship between the efficient decision making units (DMUs) of DEA and the maximal element of the partially ordered set. Building on this, a DEA model based on maximal element set (DEA-PS) is constructed based on the theory of partially ordered set theory, and the equivalence between DEA-PS model and the original DEA model is proved. Furthermore, it is proved that the dominant theorem exists in the solution of multiple classical DEA models, and a method of super-scale DEA models based on dominant theorem is given. The conclusions of this paper theoretically reveal the relationship between efficient DMUs and maximal elements, from this relationship, two key insights emerge: (1) Regardless of how huge the number of DMU is, the proposed method in this paper can realize the scale reduction of the DEA model quickly, (2) The algorithm has good compatibility with all current big data DEA model algorithms.