Finding an initial basic feasible solution for DEA models with an application on bank industry

Abstract

Nowadays, algorithms and computer programs, which are going to speed up, short time to run and less memory to occupy have special importance. Toward these ends, researchers have always regarded suitable strategies and algorithms with the least computations. Since linear programming (LP) has been introduced, interest in it spreads rapidly among scientists. To solve an LP, the simplex method has been developed and since then many researchers have contributed to the extension and progression of LP and obviously simplex method. A vast literature has been grown out of this original method in mathematical theory, new algorithms, and applied nature. Solving an LP via simplex method needs an initial basic feasible solution (IBFS), but in many situations such a solution is not readily available so artificial variables will be resorted. These artificial variables must be dropped to zero, if possible. There are two main methods that can be used to eliminate the artificial variables: two-phase method and Big-M method. Data envelopment analysis (DEA) applies individual LP for evaluating performance of decision making units, consequently, to solve these LPs an IBFS must be on hand. The main contribution of this paper is to introduce a closed form of IBFS for conventional DEA models, which helps us not to deal with artificial variables directly. We apply the proposed form to a real-data set to illustrate the applicability of the new approach. The results of this study indicate that using the closed form of IBFS can reduce at least 50 % of the whole computations.