標題: Determining a common set of weights in a DEA problem using a separation vector
作者: Chiang, C. I.
Hwang, M. J.
Liu, Y. H.
運輸與物流管理系 註:原交通所+運管所
Department of Transportation and Logistics Management
關鍵字: Weights;Multiple objectives linear programming;Fractional programming;DEA
公開日期: 1-十一月-2011
摘要: A separation method to be used for locating a set of weights, also known as a common set of weights (CSW), in the Data Envelopment Analysis (DEA) is proposed in this work. To analyze the methods of finding the CSW, it is necessary to solve a particular form of a multiple objectives fractional linear programming problem (MOFP). One of the characteristics of this particular MOFP is that the decision variables can be separated into two parts; one part of variables present in the numerator and the other part of variables present in the denominator. Based on this characteristic, this research utilized an auxiliary vector to convert the MOFP to a single objective linear programming to obtain a CSW for calculating the DMU's efficiency ratio. Finally, the developed method is applied to analyze the data of the last Beijing Olympic Games. (C) 2011 Elsevier Ltd. All rights reserved.
URI: http://dx.doi.org/10.1016/j.mcm.2011.06.002
http://hdl.handle.net/11536/18540
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2011.06.002
期刊: MATHEMATICAL AND COMPUTER MODELLING
Volume: 54
Issue: 9-10
起始頁: 2464
結束頁: 2470
顯示於類別:期刊論文


文件中的檔案:

  1. 000293829300056.pdf