Determining a common set of weights in a DEA problem using a separation vector

C. I. Chiang*, Ming-Jiu Hwang, Y. H. Liu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

29 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)2464-2470
Number of pages7
JournalMathematical and Computer Modelling
Volume54
Issue number9-10
DOIs
StatePublished - 1 Nov 2011

Keywords

  • DEA
  • Fractional programming
  • Multiple objectives linear programming
  • Weights

Fingerprint Dive into the research topics of 'Determining a common set of weights in a DEA problem using a separation vector'. Together they form a unique fingerprint.

Cite this