ScholarLens Back to search
2018•International Journal of Engineering & TechnologyOpen access

An Application of Goal Programming in Data Envelopment Analysis

B. Venkateswarlu, B. Mahaboob, J. Ravi sankar, Chandan Alenahalli Narayana, B. Madhusudhana Rao

Open full text 5 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Data envelopment analysis, Mathematical optimization, Linear programming, Axiom, Goal programming, Multiplier (economics), Fractional programming, Dual (grammatical number)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Application of Goal Programming in Data Envelopment Analysis — Research Paper | ScholarLens