A mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach
نویسندگان
چکیده مقاله:
One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856–864, 2010) proposed a bi-level structure for cost efficiency at the first time. In this model, multi-level programming and cost efficiency were used. He used a nonlinear programming to solve the model. In this paper, we have focused on multi-level structure and proposed a bi-level DEA model. We then used a liner programming to solve our model. In other hand, we significantly improved the way to achieve the optimum solution in comparison with the work by Wu (2010) by converting the NP-hard nonlinear programing into a mixed integer linear programming. This study uses a bi-level programming data envelopment analysis model that embodies internal structure with Stackelberg-game relationships to evaluate the performance of banking chain. The perspective of decentralized decisions is taken in this paper to cope with complex interactions in banking chain. The results derived from bi-level programming DEA can provide valuable insights and detailed information for managers to help them evaluate the performance of the banking chain as a whole using Stackelberg-game relationships. Finally, this model was applied in the Iranian bank to evaluate cost efficiency.
منابع مشابه
Performance Evaluation in Bank branch with Two Stage DEA Model
Data Envelopment Analysis (DEA) has been applied in many efficiency studies in the banking sector. Conventional DEA models consider the system as a single-process black box. There are however a number of so-called network DEA approach that consider the system as composed by distinct processes or stages, each one with its own inputs and outputs and with intermediate flows among the stages. In th...
متن کاملMeasuring Bank Branch Performance in Pakistan: Data Envelopment Analysis (DEA)
This study provides comparative analysis of different banks branches efficiency in Pakistan during the year 2010. The main objective of the study is to develop an effective model for measuring the relative efficiency and achievable development proficiency of selected bank branches by analyzing their competencies and deficiencies through application of Data Envelopment Analysis. Further more, th...
متن کاملA Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملPerformance Evaluation of Bank Branches by the DEA-Tobit Model: The Case of Agricultural Bank Branches in Guilan Province
This paper uses data envelopment analysis (DEA) to examine the technical, pure technical, and scale efficiencies of 12 branches of the agricultural bank in Guilan province, Iran over the period of 2012-2016. The first results indicated that scale inefficiency contributed more to overall technical inefficiency than pure technical inefficiency over the studied period. Results of return to scale r...
متن کاملA Bi-level Formulation for Centralized Resource Allocation DEA Models
In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...
متن کاملGeneration of a reduced first - level mixed integer programmimg problem
We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 12 شماره 1
صفحات -
تاریخ انتشار 2016-03-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023