Determining a common set of weights in DEA by solving a linear programming
الموضوعات :
S Saati
1
(Assistant Professor, Dep. of Mathematics, Islamic Azad University, Tehran-North Branch, Tehran, Iran)
الکلمات المفتاحية: Linear programming, Data envelopment analysis, Weight Restriction, Common Set of Weights,
ملخص المقالة :
In models of Data Envelopment Analysis (DEA), an optimal set of input and output weights is generally as-sumed to represent the assessed Decision Making Unit (DMU) in the best light in comparison to all the other DMUs. These sets of weights are, typically, different for each of the participating DMUs. Thus, it is important to find a Common Set of Weights (CSW) across the set of DMUs. In this paper, a procedure is suggested to find a CSW in DEA. In the proposed procedure by solving just one linear programming a CSW is achieved. To demonstrate the concept, a numerical example is solved
