Open AccessAn Application of Goal Programming in Data Envelopment Analysis
Author(s) -
B. Venkateswarlu,
B. Mahaboob,
Jeyaraman Sankar,
C. Narayana,
B. Madhusudhana Rao
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.10.21217
Subject(s) - data envelopment analysis , mathematical optimization , linear programming , axiom , goal programming , multiplier (economics) , fractional programming , dual (grammatical number) , transformation (genetics) , computer science , mathematics , integer programming , nonlinear programming , economics , art , biochemistry , chemistry , physics , geometry , literature , nonlinear system , quantum mechanics , gene , macroeconomics
This research paper describes the transformation of the CCR fractional Programming Problem in to the CCR linear programming problem and the dual of the CCR problem. Here the Dual of CCR problem is viewed as BCC [1] formulation Obtained by axiomatic considerations. A goal programming method for finding common weights in DEA with an improved discriminating power for efficiency was proposed by A. Makui et.al [2]. Hamid Reza Babaee Asil and Sara Fanati Rashdi [3] investigated the relationship between resource allocation problems with the problem of weight control and target selection. M. Izadikhah, R. Roostaee et.al [4] proposed a method in which DEA problem can be solved by transforming it into MOLP formulation. The present research study explains the method of finding extremely efficient DMUs and their marveric indexes, the procedure to increase the discriminating power of DEA and the Process of obtaining a set of multiplier weights common to all the DMUs which leads to Global efficiency. In the following discussion a procedure to improve the discriminative power of DEA with goal Programming is proposed.