In this paper, grey system theory and DEA are combined to establish a grey DEA model. In traditional DEA model, Input and output values of decision-making groups are all real numbers and real variables. They are replaced by grey numbers and grey variables in grey DEA model respectively. Using positioning solution method of grey linear programming, we prove the necessary condition for grey effec...

This paper presents a simplified version of Data Envelopment Analysis (DEA) a conventional approach to evaluating the performance and ranking of competitive objects characterized by two groups of factors acting in opposite directions: inputs and outputs. DEA with a Perfect Object (DEA PO) augments the group of actual objects with a virtual Perfect Object the one having greatest outputs and smal...

The deprotonation kinetics of the DEA--C02 and the DIPA-COZ zwitterions have been studied in aqueous blends of an&es at 298 K. Amine mixtures investigated were: DEA-TEA, DEA-MDEA. DEL-DMMEA, DEA-DEMEA, DIPA-TEA, DIPA-MDEA, DIPA-DMME~ DIPA-DEMEA. FOG each blend the zwitterion deprotonation constant of the additonal base present in solution (i.e. the tertiary amine) was determined. The observed d...

In the data envelopment analysis (DEA) literature, linear fractional non-cooperative network DEA models for two-stage network structures are often transformed into parametric linear models. The transformed parametric linear models are then solved by computing a series of linear models when the parameter is varied. For example, Wu, Zhu, Ji, Chu and Liang (2016) provide a linear fractional non-co...

We introduce a new solution concept for 2-person bargaining problems, which can be considered as the dual of the Equal-Area solution (EA) (see Anbarcı and Bigelow (1994)). Hence, we call it the Dual EqualArea solution (DEA). We show that the point selected by the Kalai–Smorodinsky solution (see Kalai and Smorodinsky (1975)) lies in between those that are selected by EA and DEA. We formulate an ...

Data Envelopment Analysis (DEA) is computationally intensive. This work answers conclusively questions about computational performance and scale limits of the standard LP-based procedures currently used. Examples of DEA problems with up to 15K entities are documented and it is not hard to imagine problem size increasing as new more sophisticated applications are found for DEA. This work reports...

Data envelopment analysis (DEA), based on mathematical programming techniques, is a popular method for assessing the relative efficiency of various decision-making units (DMUs). Efficient DEA computations need to circumvent intensive time-consuming calculations. This paper indicates that the “corner points” in single input and single output scatter plot has extreme efficiency with regard to the...

Accompanying the increasing popularity of DEA are computationally challenging applications: large-scale problems involving the solution of thousands of linear programs. This paper describes a new problem decomposition procedure which dramatically expedites the solution of these computationally intense problems and fully exploits parallel processing environments. Testing of a new DEA code based ...

This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.