Determining common weights in data envelopment analysis based on the satisfaction degree

The traditional data envelopment analysis model allows the decision-making units (DMUs) to evaluate their maximum efficiency values using their most favourable weights. This kind of evaluation with total weight flexibility may prevent the DMUs from being fully ranked and make the evaluation results unacceptable to the DMUs. To solve these problems, first, we introduce the concept of satisfaction degree of a DMU in relation to a common set of weights. Then a common-weight evaluation approach, which contains a max–min model and two algorithms, is proposed based on the satisfaction degrees of the DMUs. The max–min model accompanied by our Algorithm 1 can generate for the DMUs a set of common weights that maximizes the least satisfaction degrees among the DMUs. Furthermore, our Algorithm 2 can ensure that the generated common set of weights is unique and that the final satisfaction degrees of the DMUs constitute a Pareto-optimal solution. All of these factors make the evaluation results more satisfied and acceptable by all the DMUs. Finally, results from the proposed approach are contrasted with those of some previous methods for two published examples: efficiency evaluation of 17 forest districts in Taiwan and R&D project selection.     

A ranking method based on a full-inefficient frontier

Since in evaluating by traditional data envelopment analysis (DEA) models many decision making units (DMUs) are classified as efficient, a large number of methods for fully ranking both efficient and inefficient DMUs have been proposed. In this paper a ranking method is suggested which basically differs from previous methods but its models are similar to traditional DEA models such as BCC, additive model, etc. In this ranking method, DMUs are compared against an full-inefficient frontier, which will be defined in this paper. Based on this point of view many models can be designed, and we mention a radial and a slacks-based one out of them. This method can be used to rank all DMUs to get analytic information about the system, and also to rank only efficient DMUs to discriminate between them.     

Adding and removing an attribute in a DEA model: theory and processing

We present a theoretical and computational study of the impact of inserting a new attribute and removing an old attribute in a data envelopment analysis (DEA) model. Our objective is to obviate a portion of the computational effort needed to process such model changes by studying how the efficient/inefficient status of decision-making units (DMUs) is affected. Reducing computational efforts is important since DEA is known to be computationally intensive, especially in large-scale applications. We present a comprehensive theoretical study of the impact of attribute insertion and removal in DEA models, which includes sufficient conditions for identifying efficient DMUs when an attribute is added and inefficient DMUs when an attribute is removed. We also introduce a new procedure, HyperClimb, specially designed to quickly identify some of the new efficient DMUs, without involving LPs, when the model changes with the addition of an attribute. We report on results from computational tests designed to assess this procedure's effectiveness.     

Evaluating the performances of decision-making units based on interval efficiencies

Efficiency could be not only the ratio of weighted sum of outputs to that of inputs but also that of weighted sum of inputs to that of outputs. When the previous efficiency measures the best relative efficiency within the range of no more than one, the decision-making units (DMUs) who get the optimum value of one perform best among all the DMUs. If the previous efficiency is measured within the range of no less than one, the DMUs who get the optimum value of one perform worst among all the DMUs. When the later efficiency is measured within the range of no more than one, the DMUs who get the optimum value of one perform worst among all the DMUs. If the later efficiency is measured within the range of no less than one, the DMUs who get the optimum value of one perform best among all the DMUs. This paper mainly studies an interval DEA model with later efficiency, in which efficiency is measured within the range of an interval, whose upper bound is set to one and the lower bound is determined by introducing a virtual ideal DMU, whose performance is definitely superior to any DMUs. The efficiencies, obtained from interval DEA model, turn out to be all intervals and are referred to as interval efficiencies, which combine the best and the worst relative efficiency in a reasonable manner to give an overall assessment of performances for all DMUs. Assessor's preference information on input and output weights is also incorporated into interval DEA model reasonably and conveniently. Through an example, some differences are found from the ranking results obtained from interval DEA model and bounded DEA model using the Hurwicz criterion approach to rank the interval efficiencies.     

Super efficiencies or super inefficiencies? Insights from a joint computation model for slacks-based measures in DEA

The slacks-based measure (SBM) can incorporate input and output slacks that would otherwise be neglected in the classical DEA model. In parallel, the super-efficiency model for SBM (S-SBM) has been developed for the purpose of ranking SBM efficient decision-making units (DMUs). When implementing SBM in conjunction with S-SBM, however, several issues can arise. First, unlike the standard super-efficiency model, S-SBM can only solve for super-efficiency scores but not SBM scores. Second, the S-SBM model may result in weakly efficient reference points. Third, the S-SBM and SBM scores for certain DMUs may be discontinuous with a perturbation to their inputs and outputs, making it hard to interpret and justify the scores in applications and the efficiency scores may be sensitive to small changes/errors in data. Due to this discontinuity, the S-SBM model may overestimate the super-efficiency score. This paper extends the existing SBM approaches and develops a joint model (J-SBM) that addresses the above issues; namely, the J-SBM model can (1) simultaneously compute SBM scores for inefficient DMUs and super-efficiency for efficient DMUs, (2) guarantee the reference points generated by the joint model are Pareto-efficient, and (3) the J-SBM scores of a firm are continuous in the input and output space. Interestingly, the radial DEA efficiency and super-efficiency scores for a DMU are continuous in the input–output space. The J-SBM model combines the merits of the radial and SBM models (i.e., continuity and Pareto-efficiency).     

决策单元的投影问题研究

在传统的DEA模型中,不论是最优相对效率模型或者最差相对效率模型,它们研究投影问题都是在不同的约束域内进行的,得出的结论都有一定的片面性.在bounded DEA模型中,决策单元的效率计算是在一个区间内进行的,可以同时研究非DEA有效的决策单元在有效前沿面上的投影和非DEA无效的决策单元在DEA无效面上的投影,得出的结论更加科学合理,并以定理的形式给出了投影结果的表达式.通过一个实例将投影结果与传统模型中得出的投影结果进行了比较,发现bounded DEA模型得到的投影结果对实际的生产具有更强的指导意义.     

Sensitivity and stability in stochastic data envelopment analysis

Sensitivity and stability for Banker's model of Stochastic Data Envelopment Analysis (SDEA) is studied in this paper. In the case of the DEA model, necessary and sufficient conditions to preserve the efficiency of efficient decision-making units (DMUs) and the inefficiency of inefficient DMUs are obtained for different perturbations of data in the model. The cases of perturbations of all inputs, of perturbations of output and of the simultaneous perturbations of output and all inputs are considered. An illustrative example is provided.     

A new DEA ranking system based on changing the reference set

This research proposes a new ranking system for extreme efficient DMUs (Decision Making Units) based upon the omission of these efficient DMUs from reference set of the inefficient DMUs. We state and prove some facts related to our model. A numerical example where the proposed method is compared with traditional ranking approaches is shown.     

Measuring the performances of decision-making units using interval efficiencies

Efficiency is a relative measure because it can be measured within different ranges. The traditional data envelopment analysis (DEA) measures the efficiencies of decision-making units (DMUs) within the range of less than or equal to one. The corresponding efficiencies are referred to as the best relative efficiencies, which measure the best performances of DMUs and determine an efficiency frontier. If the efficiencies are measured within the range of greater than or equal to one, then the worst relative efficiencies can be used to measure the worst performances of DMUs and determine an inefficiency frontier. In this paper, the efficiencies of DMUs are measured within the range of an interval, whose upper bound is set to one and the lower bound is determined through introducing a virtual anti-ideal DMU, whose performance is definitely inferior to any DMUs. The efficiencies turn out to be all intervals and are thus referred to as interval efficiencies, which combine the best and the worst relative efficiencies in a reasonable manner to give an overall measurement and assessment of the performances of DMUs. The new DEA model with the upper and lower bounds on efficiencies is referred to as bounded DEA model, which can incorporate decision maker (DM) or assessor's preference information on input and output weights. A Hurwicz criterion approach is introduced and utilized to compare and rank the interval efficiencies of DMUs and a numerical example is examined using the proposed bounded DEA model to show its potential application and validity.     

Optimal system design series-network DEA models

There is an urgent need in a wide range of fields such as logistics and supply chain management to develop effective approaches to measure and/or optimally design a network system comprised of a set of units. Data envelopment analysis (DEA) researchers have been developing network DEA models to measure decision making units’ (DMUs’) network systems. However, to our knowledge, there are no previous contributions on the DEA-type models that help DMUs optimally design their network systems. The need to design optimal systems is quite common and is sometimes necessary in practice. This research thus introduces a new type of DEA model termed the optimal system design (OSD) network DEA model to optimally design a DMUs (exogenous and endogenous) input and (endogenous and final) output portfolios in terms of profit maximization given the DMUs total available budget. The resulting optimal network design through the proposed OSD network DEA models is efficient, that is, it lies on the frontier of the corresponding production possibility set.     

Benchmark optimization and attribute identification for improvement of container terminals

The aim of this paper is to optimize the benchmarks and prioritize the variables of decision-making units (DMUs) in data envelopment analysis (DEA) model. In DEA, there is no scope to differentiate and identify threats for efficient DMUs from the inefficient set. Although benchmarks in DEA allow for identification of targets for improvement, it does not prioritize targets or prescribe level-wise improvement path for inefficient units. This paper presents a decision tree based DEA model to enhance the capability and flexibility of classical DEA. The approach is illustrated through its application to container port industry. The method proceeds by construction of multiple efficient frontiers to identify threats for efficient/inefficient DMUs, provide level-wise reference set for inefficient terminals and diagnose the factors that differentiate the performance of inefficient DMUs. It is followed by identification of significant attributes crucial for improvement in different performance levels. The application of this approach will enable decision makers to identify threats and opportunities facing their business and to improve inefficient units relative to their maximum capacity. In addition, it will help them to make intelligent investment on target factors that can improve their firms’ productivity.     

Ranking efficient decision making units in data envelopment analysis based on reference frontier share

Data envelopment analysis (DEA) is a powerful technique for performance evaluation of decision making units (DMUs). Ranking efficient DMUs based on a rational analysis is an issue that yet needs further research. The impact of each efficient DMU in evaluation of inefficient DMUs can be considered as additional information to discriminating among efficient DMUs. The concept of reference frontier share is introduced in which the share of each efficient DMU in construction of the reference frontier for evaluating inefficient DMUs is considered. For this purpose a model for measuring the reference frontier share of each efficient DMU associated with each inefficient one is proposed and then a total measure is provided based on which the ranking is made. The new approach has the capability for ranking extreme and non-extreme efficient DMUs. Further, it has no problem in dealing with negative data. These facts are verified by theorems, discussions and numerical examples.     

An interactive benchmark model ranking performers — Application to financial holding companies

This study aims to resolve the problems associated with ranking fairly for both efficient and inefficient decision making units (DMUs) by proposing an ‘interactive benchmark’ model. The main concept is derived as a result of taking one certain DMU as a fixed benchmark and estimating the efficiency scores of the remaining DMUs based on that benchmark pair by pair. The process is repeated until all of the DMUs have served as the fixed benchmark. The DMUs can then be evaluated on a fair basis by computing the average efficiency scores using the above rolling procedure. The model is applied to fourteen financial holding companies (FHCs) in Taiwan using a production transfer model that is adopted by Seiford and Zhu [L.M. Seiford, J. Zhu, Profitability and marketability of the top 55 US commercial banks, Management Science 45 (9) (1999) 1270–1288]. The empirical results can serve as valuable reference to both policy-makers and investors.     

A modified super-efficiency DEA model for infeasibility

The super-efficiency data envelopment analysis (DEA) model is obtained when a decision making unit (DMU) under evaluation is excluded from the reference set. This model provides for a measure of stability of the “efficient” status for frontier DMUs. Under the assumption of variable returns to scale (VRS), the super efficiency model can be infeasible for some efficient DMUs, specifically those at the extremities of the frontier. The current study develops an approach to overcome infeasibility issues. It is shown that when the model is feasible, our approach yields super-efficiency scores that are equivalent to those arising from the original model. For efficient DMUs that are infeasible under the super-efficiency model, our approach yields optimal solutions and scores that characterize the extent of super-efficiency in both inputs and outputs. The newly developed approach is illustrated with two real world data sets.     

A bargaining game model for measuring performance of two-stage network structures

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs), where the internal structures of DMUs are treated as a black-box. Recently DEA has been extended to examine the efficiency of DMUs that have two-stage network structures or processes, where all the outputs from the first stage are intermediate measures that make up the inputs to the second stage. The resulting two-stage DEA model not only provides an overall efficiency score for the entire process, but also yields an efficiency score for each of the individual stages. The current paper develops a Nash bargaining game model to measure the performance of DMUs that have a two-stage structure. Under Nash bargaining theory, the two stages are viewed as players and the DEA efficiency model is a cooperative game model. It is shown that when only one intermediate measure exists between the two stages, our newly developed Nash bargaining game approach yields the same results as applying the standard DEA approach to each stage separately. Two real world data sets are used to demonstrate our bargaining game model.     

Centralized resource allocation for enhanced Russell models

This paper proposes a centralized resource allocation (CRA) model for the enhanced Russell model. All the DMUs can be easily projected onto the efficient frontier by solving only one model. This projection can be made by transforming the proposed model to a linear programming problem. In this paper, instead of non-radially increasing or decreasing the inputs or outputs individually, we increase or decrease non-radially all of the inputs and outputs at the same time. By solving a single model, we can provide targets for all DMUs. By the proposed approximation, different targets can be found for all DMUs, as compared to those obtained by the previous approximations. The proposed model can be developed to CRA models. Finally, an applied example emphasizes the importance of the proposed model.     

A network-based approach for increasing discrimination in data envelopment analysis

Data envelopment analysis (DEA) is known to produce more than one efficient decision-making unit (DMU). This paper proposes a network-based approach for further increasing discrimination among these efficient DMUs. The approach treats the system under study as a directed and weighted network in which nodes represent DMUs and the direction and strength of the links represent the relative relationship among DMUs. In constructing the network, the observed node is set to point to its referent DMUs as suggested by DEA. The corresponding lambda values for these referent DMUs are taken as the strength of the network link. The network is weaved by not only the full input/output model, but also by models of all possible input/output combinations. Incorporating these models into the system basically introduces the merits of each DMU under various situations into the system and thus provides the key information for further discrimination. Once the network is constructed, the centrality concept commonly used in social network analysis—specifically, eigenvector centrality—is employed to rank the efficient DMUs. The network-based approach tends to rank high the DMUs that are not specialized and have balanced strengths.     

A compromise solution approach for finding common weights in DEA: an improvement to Kao and Hung's approach

Data envelopment analysis (DEA) is the leading technique for measuring the relative efficiency of decision-making units (DMUs) on the basis of multiple inputs and multiple outputs. In this technique, the weights for inputs and outputs are estimated in the best advantage for each unit so as to maximize its relative efficiency. But, this flexibility in selecting the weights deters the comparison among DMUs on a common base. For dealing with this difficulty, Kao and Hung (2005) proposed a compromise solution approach for generating common weights under the DEA framework. The proposed multiple criteria decision-making (MCDM) model was derived from the original non-linear DEA model. This paper presents an improvement to Kao and Hung's approach by means of introducing an MCDM model which is derived from a new linear DEA model.     

Interval DEA模型中决策单元的投影问题

在传统的DEA模型中,最优相对效率模型是在不大于1的范围内研究决策单元的效率的,最差相对效率模型是在不小于1的范围内研究决策单元的效率,这两种模型在研究投影问题时,是在不同的范围内进行的,有一定的片面性.将在interval DEA模型中,研究决策单元的投影问题,该模型是在相同的约束域内研究最优和最差相对效率模型,得出的结论将更加全面,通过两个定理给出了非DEA有效的决策单元在DEA有效面上的投影表达式和非DEA无效的决策单元在DEA无效面上的投影表达式.同时,通过一个实例对决策单元在interval DEA模型中的投影结果与在传统的DEA模型的投影结果进行了比较,发现投影结果比传统模型得到的投影结果对实际的生产有更强的指导意义.     

Data envelopment analysis with common weights: the compromise solution approach

A characteristic of data envelopment analysis (DEA) is to allow individual decision-making units (DMUs) to select the factor weights that are the most advantageous for them in calculating their efficiency scores. This flexibility in selecting the weights, on the other hand, deters the comparison among DMUs on a common base. In order to rank all the DMUs on the same scale, this paper proposes a compromise solution approach for generating common weights under the DEA framework. The efficiency scores calculated from the standard DEA model are regarded as the ideal solution for the DMUs to achieve. A common set of weights which produces the vector of efficiency scores for the DMUs closest to the ideal solution is sought. Based on the generalized measure of distance, a family of efficiency scores called ‘compromise solutions’ can be derived. The compromise solutions have the properties of unique solution and Pareto optimality not enjoyed by the solutions derived from the existing methods of common weights. An example of forest management illustrates that the compromise solution approach is able to generate a common set of weights, which not only differentiates efficient DMUs but also detects abnormal efficiency scores on a common base.