Network DEA pitfalls: Divisional efficiency and frontier projection under general network structures

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). Recently network DEA models been developed to examine the efficiency of DMUs with internal structures. The internal network structures range from a simple two-stage process to a complex system where multiple divisions are linked together with intermediate measures. In general, there are two types of network DEA models. One is developed under the standard multiplier DEA models based upon the DEA ratio efficiency, and the other under the envelopment DEA models based upon production possibility sets. While the multiplier and envelopment DEA models are dual models and equivalent under the standard DEA, such is not necessarily true for the two types of network DEA models. Pitfalls in network DEA are discussed with respect to the determination of divisional efficiency, frontier type, and projections. We point out that the envelopment-based network DEA model should be used for determining the frontier projection for inefficient DMUs while the multiplier-based network DEA model should be used for determining the divisional efficiency. Finally, we demonstrate that under general network structures, the multiplier and envelopment network DEA models are two different approaches. The divisional efficiency obtained from the multiplier network DEA model can be infeasible in the envelopment network DEA model. This indicates that these two types of network DEA models use different concepts of efficiency. We further demonstrate that the envelopment model’s divisional efficiency may actually be the overall efficiency.     

Integrated data envelopment analysis: Global vs. local optimum

Chiou et al. (2010) (A joint measurement of efficiency and effectiveness for non-storable commodities: integrated data envelopment analysis approaches. European Journal of Operational Research 201, 477–489) propose an integrated data envelopment analysis model in measuring decision making units (DMUs) that have a two-stage internal network structure with multiple inputs, outputs, and consumptions. They claim that any optimal solutions determined by their DEA model are a global optimum, not a local optimum. We show that such a conclusion is a false statement due to their misuse of Hessian matrix in examining the concavity of the objective function, and their DEA model is actually a non-convex optimization problem. As a result, their DEA model is unusable in practice due to a lack of efficient algorithm for this particular non-convex DEA model. We further show that Chiou et al.’s (2010) model is a special case of a well-known two-stage network DEA model, and it can be transformed into a parametric linear program for which an approximate global optimal solution can be obtained by solving a sequence of linear programs in combination with a simple search algorithm.     

Equivalent solutions to additive two-stage network data envelopment analysis

In the additive approach of two-stage network data envelopment analysis (DEA), the non-linear DEA model is transformed into a parametric linear model and then solved by computing a series of linear programs. Lim and Zhu (2013; Integrated data envelopment analysis: Global vs. local optimum.European Journal of Operational Research, 229(1), 276–278) and Ang and Chen (2016; Pitfalls of decomposition weights in the additive multi-stage DEA model. Omega, 58, 139–153) propose two parametric linear approaches to solve additive two-stage network DEA model. The current study shows that the two approaches are equivalent and use the same parameter in searching for the global optimal solution.     

DEA模型在资金分配和管理中的应用

资金的合理使用,是经济活动中的一个非常重要的问题.利用DEA的理论、方法模型,探讨资金的使用效率、分配的合理性,以及最佳资金预算的确定方法.涉及的DEA模型结构属于非参数的最优化DEA模型,以及DEA平行网络结构.模型中所使用的生产可能集是可以评价是否呈现"拥挤"迹象的.     

Optimal budget for system design series network DEA model

Wei and Chang (2011a) developed optimal system design (OSD) data envelopment analysis (DEA) models to design a decision-making unit (DMU)’s optimal system, in which the DMU could encounter the well-known economic phenomenon of budget congestion. To show how to verify the optimal budget and budget congestion, they develop a solution method. In this paper, we note that their method is incorrect for the OSD network DEA model in general. A new approach is developed to derive the DMU’s corresponding optimal budgets and to check for the existence of budget congestion not only for the OSD DEA models but also for the OSD network DEA models. In addition, the proposed approach is computationally economical. Finally, two numerical examples are used to illustrate the proposed approach.     

Network DEA: Additive efficiency decomposition

In conventional DEA analysis, DMUs are generally treated as a black-box in the sense that internal structures are ignored, and the performance of a DMU is assumed to be a function of a set of chosen inputs and outputs. A significant body of work has been directed at problem settings where the DMU is characterized by a multistage process; supply chains and many manufacturing processes take this form. Recent DEA literature on serial processes has tended to concentrate on closed systems, that is, where the outputs from one stage become the inputs to the next stage, and where no other inputs enter the process at any intermediate stage. The current paper examines the more general problem of an open multistage process. Here, some outputs from a given stage may leave the system while others become inputs to the next stage. As well, new inputs can enter at any stage. We then extend the methodology to examine general network structures. We represent the overall efficiency of such a structure as an additive weighted average of the efficiencies of the individual components or stages that make up that structure. The model therefore allows one to evaluate not only the overall performance of the network, but as well represent how that performance decomposes into measures for the individual components of the network. We illustrate the model using two 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.     

An input relaxation measure of efficiency in stochastic data envelopment analysis

We introduce stochastic version of an input relaxation model in data envelopment analysis (DEA). The input relaxation model, recently developed in DEA, is useful to resource management [e.g. G.R. Jahanshahloo, M. Khodabakhshi, Suitable combination of inputs for improving outputs in DEA with determining input congestion, Appl. Math. Comput. 151(1) (2004) 263–273]. This model allows more changes in the input combinations of decision making units than those in the observed inputs of evaluating decision making units. Using this extra flexibility in input combinations we can find better outputs. We obtain a non-linear deterministic equivalent to this stochastic model. It is shown that under fairly general conditions this non-linear model can be replaced by an ordinary deterministic DEA model. The model is illustrated using a real data set.     

带偏好DEA在“科学研究基金”管理中的应用研究

将带偏好锥DEA理论引入科学研究基金管理中,在包含"拥挤"迹象的生产可能集基础上建立了三个带偏好锥的平行网络结构DEA模型,对科研基金投入后产生的"成效"进行评价.这些模型分别从三个层面探讨了科研基金使用效率、分配合理性,以及最佳基金预算的确定方法.     

Data envelopment analysis with imprecise data

In original data envelopment analysis (DEA) models, inputs and outputs are measured by exact values on a ratio scale. Cooper et al. [Management Science, 45 (1999) 597–607] recently addressed the problem of imprecise data in DEA, in its general form. We develop in this paper an alternative approach for dealing with imprecise data in DEA. Our approach is to transform a non-linear DEA model to a linear programming equivalent, on the basis of the original data set, by applying transformations only on the variables. Upper and lower bounds for the efficiency scores of the units are then defined as natural outcomes of our formulations. It is our specific formulation that enables us to proceed further in discriminating among the efficient units by means of a post-DEA model and the endurance indices. We then proceed still further in formulating another post-DEA model for determining input thresholds that turn an inefficient unit to an efficient one.     

Network DEA: A slacks-based measure approach

Traditional DEA models deal with measurements of relative efficiency of DMUs regarding multiple-inputs vs. multiple-outputs. One of the drawbacks of these models is the neglect of intermediate products or linking activities. After pointing out needs for inclusion of them to DEA models, we propose a slacks-based network DEA model, called Network SBM, that can deal with intermediate products formally. Using this model we can evaluate divisional efficiencies along with the overall efficiency of decision making units (DMUs).     

Data envelopment analysis of mutual funds based on second-order stochastic dominance

Although data envelopment analysis (DEA) has been extensively used to assess the performance of mutual funds (MF), most of the approaches overestimate the risk associated to the endogenous benchmark portfolio. This is because in the conventional DEA technology the risk of the target portfolio is computed as a linear combination of the risk of the assessed MF. This neglects the important effects of portfolio diversification. Other approaches based on mean–variance or mean–variance–skewness are non-linear. We propose to combine DEA with stochastic dominance criteria. Thus, in this paper, six distinct DEA-like linear programming (LP) models are proposed for computing relative efficiency scores consistent (in the sense of necessity) with second-order stochastic dominance (SSD). The aim is that, being SSD efficient, the obtained target portfolio should be an optimal benchmark for any rational risk-averse investor. The proposed models are compared with several related approaches from the literature.     

Conic approximation to quadratic optimization with linear complementarity constraints

This paper proposes a conic approximation algorithm for solving quadratic optimization problems with linear complementarity constraints.We provide a conic reformulation and its dual for the original problem such that these three problems share the same optimal objective value. Moreover, we show that the conic reformulation problem is attainable when the original problem has a nonempty and bounded feasible domain. Since the conic reformulation is in general a hard problem, some conic relaxations are further considered. We offer a condition under which both the semidefinite relaxation and its dual problem become strictly feasible for finding a lower bound in polynomial time. For more general cases, by adaptively refining the outer approximation of the feasible set, we propose a conic approximation algorithm to identify an optimal solution or an \(\epsilon \)-optimal solution of the original problem. A convergence proof is given under simple assumptions. Some computational results are included to illustrate the effectiveness of the proposed algorithm.     

A game theoretical model of DEA efficiency

Motivated by the inherent competitive nature of the DEA efficiency assessment process, some effort has been made to relate DEA models to game theory. Game theory is considered not only a more natural source of representing competitive situations, but also beneficial in revealing additional insights into practical efficiency analysis. Past studies are limited to connecting efficiency games to some particular versions of DEA models. The generalised DEA model considered in this study unifies various important DEA models and presents a basic formulation for the DEA family. By introducing a generalised convex cone constrained efficiency game model in assembling the generalised DEA model, a rigorous connection between game theory and the DEA family is established. We prove the existence of optimal strategies in the generalised efficiency game. We show the equivalence between game efficiency and DEA efficiency. We also provide convex programming models for determination of the optimal strategies of the proposed games, and show that the game efficiency unit corresponds to the non-dominated solution in its corresponding multi-objective programming problem. Our study largely extends the latest developments in this area. The significance of such an extension is for research and applications of both game theory and DEA.     

A generalized model for data envelopment analysis with interval data

Data envelopment analysis (DEA) is a method to estimate the relative efficiency of decision-making units (DMUs) performing similar tasks in a production system that consumes multiple inputs to produce multiple outputs. So far, a number of DEA models with interval data have been developed. The CCR model with interval data, the BCC model with interval data and the FDH model with interval data are well known as basic DEA models with interval data. In this study, we suggest a model with interval data called interval generalized DEA (IGDEA) model, which can treat the stated basic DEA models with interval data in a unified way. In addition, by establishing the theoretical properties of the relationships among the IGDEA model and those DEA models with interval data, we prove that the IGDEA model makes it possible to calculate the efficiency of DMUs incorporating various preference structures of decision makers.     

Measuring overall efficiency and effectiveness using DEA

This paper presents a framework where data envelopment analysis (DEA) is used to measure overall efficiency and show how to apply this framework to assess effectiveness for more general behavioral goals. The relationships between various cone-ratio DEA models and models to measure overall efficiency are clarified. Specifically it is shown that as multiplier cones tighten, the cone-ratio DEA models converge to measures of overall efficiency. Furthermore, it is argued that multiplier cone and cone-ratio model selection must be consistent with the behavioral goals assigned or assumed for purposes of analysis. Consistent with this reasoning, two new models are introduced to measure effectiveness when value measures are represented by separable or linked cones, where the latter can be used to analyze profit-maximizing effectiveness.     

解线性约束优化问题的新锥模型信赖域法

本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法.论文采用零空间技术消除了新锥模型子问题中的线性等式约束,用折线法求解转换后的子问题,并给出了解线性等式约束优化问题的信赖域方法.论文提出并证明了该方法的全局收敛性,并给出了该方法解线性等式约束优化问题的数值实验.理论和数值实验结果表明新锥模型信赖域方法是有效的,这给出了用新锥模型进一步研究非线性优化的基础.     

DEA Cobb–Douglas frontier and cross-efficiency

The current paper examines the cross-efficiency concept in data envelopment analysis (DEA). While cross-efficiency has appeal as a peer evaluation approach, it is often the subject of criticism, due mainly to the use of DEA weights that are often non-unique. As a result, cross-efficiency scores are routinely viewed as arbitrary in that they depend on a particular set of optimal DEA weights generated by the computer code in use at the time. While imposing secondary goals can reduce the variability of cross-efficiency scores, such approaches do not completely solve the problem of non-uniqueness, and meaningful secondary goals can lead to computationally intractable non-linear programs. The current paper proposes to use the units-invariant multiplicative DEA model to calculate the cross-efficiency scores. This allows one to calculate the maximum cross-efficiency score for each DMU in a converted linear model, and eliminates the need for imposing secondary goals.     

Linear Programming Approximations for Markov Control Processes in Metric Spaces

We develop a general framework to analyze the convergence of linear-programming approximations for Markov control processes in metric spaces. The approximations are based on aggregation and relaxation of constraints, as well as inner approximations of the decision variables. In particular, conditions are given under which the control problems optimal value can be approximated by a sequence of finite-dimensional linear programs.     

具有非期望产出的混联网络DEA模型

数据包络分析(DEA)是评价系统相对有效性的分析方法,网络DEA模型在评价企业的经济效益、管理效益等实际问题中有着广泛的应用.在网络DEA模型的基础上考虑非期望产出要素,提出了具有非期望产出的混联网络DEA模型.研究了新模型的系统弱DEA有效与各子阶段弱DEA有效之间的关系,找到了无效决策单元的无效阶段,通过有针对性的改进能够提高系统的整体效率.最后通过数值算例验证了模型的可行性.