A goal programming approach to solve the multiple criteria DEA model

The lack of discrimination power and the inappropriate multipliers schemes remain major issues in data envelopment analysis (DEA). To overcome these problems, the multiple criteria DEA (MCDEA) model was introduced in the late 1990s, drawing from a multiple objective perspective. However, because the objectives of the MCDEA model are generally conflicting, an optimal solution satisfying all objectives simultaneously often does not exist. Within this context, goal programming (GP) approaches were proposed to solve the MCDEA model. This paper focuses specifically on the GP formulation, known as GPDEA. However, recently, the GPDEA models were found to be invalid, and no alternative formulation, under a GP framework, was proposed. Therefore, the aim here is to develop a formulation for adequately solving the MCDEA model using weighted GP. In order to do so, we point out inconsistencies in the existing GPDEA models, and we present the WGP-MCDEA model.