Generating strong defining hyperplanes of the production possibility set in data envelopment analysis

In data envelopment analysis (DEA), identification of the strong defining hyperplanes of the empirical production possibility set (PPS) is important, because they can be used for determining rates of change of outputs with change in inputs. Also, efficient hyperplanes determine the nature of returns to scale. The present work proposes a method for generating all linearly independent strong defining hyperplanes (LISDHs) of the PPS passing through a specific decision making unit (DMU). To this end, corresponding to each efficient unit, a perturbed inefficient unit will be defined and, using at most m+s linear programs, all LISDHs passing through the DMU will be determined, where m and s are the numbers of inputs and outputs, respectively.     

Finding strong defining hyperplanes of Production Possibility Set

Production Possibility Set (PPS) is defined as the set of all inputs and outputs of a system in which inputs can produce outputs. Data Envelopment Analysis models implicitly use PPS to evaluate relative efficiency of Decision Making Units (DMUs). Although DEA models can determine the efficiency of a DMU, they cannot present efficient frontiers of PPS. In this paper, we propose a method for finding all Strong Defining Hyperplanes of PPS (SDHP). They are equations that form efficient surfaces. These equations are useful in Sensitivity and Stability Analysis, the status of Returns to Scale of a DMU, incorporating performance information into the efficient frontier analysis and so on.     

Finding weak defining hyperplanes of PPS of the BCC model

Production possibility set (PPS) is intersection of the several halfspaces. Every halfspace corresponds with one strong or weak defining hyperplane (facet). This research proposes a method to find weak defining hyperplanes of PPS of BCC model. We state and prove some properties relative to our method. Numerical examples are provided for illustration.     

An inverse optimization model for imprecise data envelopment analysis

Inverse data envelopment analysis (InDEA) is a well-known approach for short-term forecasting of a given decision-making unit (DMU). The conventional InDEA models use the production possibility set (PPS) that is composed of an evaluated DMU with current inputs and outputs. In this paper, we replace the fluctuated DMU with a modified DMU involving renewal inputs and outputs in the PPS since the DMU with current data cannot be allowed to establish the new PPS. Besides, the classical DEA models such as InDEA are assumed to consider perfect knowledge of the input and output values but in numerous situations, this assumption may not be realistic. The observed values of the data in these situations can sometimes be defined as interval numbers instead of crisp numbers. Here, we extend the InDEA model to interval data for evaluating the relative efficiency of DMUs. The proposed models determine the lower and upper bounds of the inputs of a given DMU separately when its interval outputs are changed in the performance analysis process. We aim to remain the current interval efficiency of a considered DMU and the interval efficiencies of the remaining DMUs fixed or even improve compared with the current interval efficiencies.     

Ranking DMUs by l1-norm with fuzzy data in DEA

The relative efficiency of a DMU is the result of comparing the inputs and outputs of the DMU and those of other DMUs in the PPS (production possibility set). If the inputs and outputs are fuzzy, the DMUs cannot be easily evaluated and ranked using the obtained efficiency scores. In this paper, presenting a new idea for ranking of DMUs with fuzzy data. And finally, we introduce a numerical example.     

A new framework for the solution of DEA models

We provide an alternative framework for solving data envelopment analysis (DEA) models which, in comparison with the standard linear programming (LP) based approach that solves one LP for each decision making unit (DMU), delivers much more information. By projecting out all the variables which are common to all LP runs, we obtain a formula into which we can substitute the inputs and outputs of each DMU in turn in order to obtain its efficiency number and all possible primal and dual optimal solutions. The method of projection, which we use, is Fourier–Motzkin (F–M) elimination. This provides us with the finite number of extreme rays of the elimination cone. These rays give the dual multipliers which can be interpreted as weights which will apply to the inputs and outputs for particular DMUs. As the approach provides all the extreme rays of the cone, multiple sets of weights, when they exist, are explicitly provided. Several applications are presented. It is shown that the output from the F–M method improves on existing methods of (i) establishing the returns to scale status of each DMU, (ii) calculating cross-efficiencies and (iii) dealing with weight flexibility. The method also demonstrates that the same weightings will apply to all DMUs having the same comparators. In addition it is possible to construct the skeleton of the efficient frontier of efficient DMUs. Finally, our experiments clearly indicate that the extra computational burden is not excessive for most practical problems.     

Robustness of the efficient DMUs in data envelopment analysis

By means of modified versions of CCR model based on evaluation of a decision making unit (DMU) relative to a reference set grouped by all other DMUs, sensitivity analysis of the CCR model in data envelopment analysis (DEA) is studied in this paper. The methods for sensitivity analysis are linear programming problems whose optimal values yield particular regions of stability. Sufficient and necessary conditions for upward variations of inputs and for downward variations of outputs of an (extremely) efficient DMU which remains efficient are provided. The approach does not require calculation of the basic solutions and of the inverse of the corresponding optimal basis matrix. The approach is illustrated by two numerical examples.     

Characterizing and finding full dimensional efficient facets in DEA: a variable returns to scale specification

The full dimensional efficient facets (FDEFs) of a production possibility set (PPS) play a key role in data envelopment analysis (DEA). Finding the FDEFs has been the subject of intensive research over the past decade. The available algorithms for finding the FDEFs in the current DEA literature either require information about the position of all the extreme efficient decision-making units on the facets of the PPS or knowledge of all extreme optimal solutions of the multiplier form of the BCC model. In this article, we develop an algorithm that does not require such crucial information that may not be easily available. To this purpose, we first carefully analyse the structure of the FDEFs of PPS with BCC technology, using basic concepts of polyhedral set theory. We then utilize this information to devise an algorithm for finding the FDEFs, using mixed integer linear programming. We illustrate our algorithm using a set of real data.     

Choosing weights from alternative optimal solutions of dual multiplier models in DEA

In this paper we propose a two-step procedure to be used for the selection of the weights that we obtain from the multiplier model in a DEA efficiency analysis. It is well known that optimal solutions of the envelopment formulation for extreme efficient units are often highly degenerate and, consequently, have alternate optima for the weights. Different optimal weights may then be obtained depending, for instance, on the software used. The idea behind the procedure we present is to explore the set of alternate optima in order to help make a choice of optimal weights. The selection of weights for a given extreme efficient point is connected with the dimension of the efficient facets of the frontier. Our approach makes it possible to select the weights associated with the facets of higher dimension that this unit generates and, in particular, it selects those weights associated with a full dimensional efficient facet (FDEF) if any. In this sense the weights provided by our procedure will have the maximum support from the production possibility set. We also look for weights that maximize the relative value of the inputs and outputs included in the efficiency analysis in a sense to be described in this article.     

Sensitivity in data envelopment analysis using an approximate inverse matrix

In this paper, sensitivity analysis of the Charnes–Cooper–Rhodes model in data envelopment analysis (DEA) is studied for the case of perturbation of all outputs and of all inputs of an efficient decision-making unit (DMU). Using an approximate inverse of the perturbed optimal basis matrix, an approximate preservation of efficiency for an efficient DMU under these perturbations is considered. Sufficient conditions for an efficient DMU to preserve its efficiency are obtained in that case. An illustrative example is provided.     

混合的DEA模型最优解的存在性

有ｎ个决策单元。设被评价的决策单元可以不是这ｎ个之一,且它们的输入或输出可以取负值,在这样情况下,给出了混合的ＤＥＡ模型存在最优解的必要条件或充分条件     

Data Envelopment Analysis with Preference Structure

It is important to consider the decision making unit (DMU)'s or decision maker's preference over the potential adjustments of various inputs and outputs when data envelopment analysis (DEA) is employed. On the basis of the so-called Russell measure, this paper develops some weighted non-radial CCR models by specifying a proper set of ‘preference weights’ that reflect the relative degree of desirability of the potential adjustments of current input or output levels. These input or output adjustments can be either less or greater than one; that is, the approach enables certain inputs actually to be increased, or certain outputs actually to be decreased. It is shown that the preference structure prescribes fixed weights (virtual multiplier bounds) or regions that invalidate some virtual multipliers and hence it generates preferred (efficient) input and output targets for each DMU. In addition to providing the preferred target, the approach gives a scalar efficiency score for each DMU to secure comparability. It is also shown how specific cases of our approach handle non-controllable factors in DEA and measure allocative and technical efficiency. Finally, the methodology is applied with the industrial performance of 14 open coastal cities and four special economic zones in 1991 in China. As applied here, the DEA/preference structure model refines the original DEA model's result and eliminates apparently efficient DMUs.     

有关判断决策单元的DEA有效性的新方法的探讨

为了判断决策单元是否(弱)DEA有效并克服现有的模型及[1]中模型在解决上述问题时的不足之处,本文将讨论的新模型是由CCR模型与CCGSS模型变来的,且定理的证明不同于[1]．还讨论了文中新模型的最优解的存在性,此外,研究了所有决策单元的输入输出的变化对某决策单元有效性的影响．     

Identifying the efficiency status in network DEA

Data envelopment analysis (DEA) is commonly employed to evaluate the efficiency performance of a decision making unit (DMU) that transforms exogenous inputs into final outputs. In such a black-box DEA approach, details of an internal production process of the DMU are typically ignored and hence the locations of inefficiency are not adequately provided. In view of this, DEA researchers have recently developed various network approaches by looking into the black box, where the inputs that enter the box and the outputs that come out of it are only considered. However, most of these network approaches evaluate divisional efficiency by using an optimal solution of their respective optimization problem. If such an optimal solution is used in the case when there are multiple optima, then managerial guidance based on this solution alone may be inappropriate because more appropriate targets from the viewpoint of management may be ignored. Taking this fact into account, therefore, we propose a network approach for identifying the efficiency status of each DMU and its divisions. This approach provides a practical computational procedure.     

Improvement of efficiency intervals based on DEA by adjusting inputs and outputs

We improve the efficiency interval of a DMU by adjusting its given inputs and outputs. The Interval DEA model has been formulated to obtain an efficiency interval consisting of evaluations from both the optimistic and pessimistic viewpoints. DMUs which are not rated as efficient in the conventional sense are improved so that their lower bounds become as large as possible under the condition that their upper bounds attain the maximum value one. The adjusted inputs and outputs keep each other balanced by improving the lower bound of efficiency interval, since the lower bound becomes small if all the inputs and outputs are not proportioned. In order to improve the lower bound of efficiency interval, different target points are defined for different DMUs. The target point can be regarded as a kind of benchmark for the DMU. First, a new approach to improvement by adjusting only outputs or inputs is proposed. Then, the combined approach to improvement by adjusting both inputs and outputs simultaneously is proposed. Lastly, numerical examples are shown to illustrate our proposed approaches.     

求DEA有效最速方向的一般方法

提出经验生产可能集的支撑超平面表示形式，在献[3]的基础上，对生产可能集内任意非DEA有效的决策单元，给出在生产可能集内，求解其DEA有效最速方向，使其最速达到DEA有效的一般方向，同时指出献[4]、[7]中的两处错误。     

Separation of convex sets by extreme hyperplanes

The problem of separation of convex sets by extreme hyperplanes (functionals) in normed linear spaces is examined. The concept of a bar (a closed set of special form) is introduced; it is shown that a bar is characterized by the property that any point not lying in it can be separated from it by an extreme hyperplane. In two-dimensional spaces, in spaces with strictly convex dual, and in the space of continuous functions, any two bars are extremely separated. This property is shown to fail in the space of summable functions. A number of examples and generalizations are given.     

Classifying and characterizing efficiencies and inefficiencies in data development analysis

DEA (Data Envelopment Analysis) attempts to identify sources and estimate amounts of inefficiencies contained in the outputs and inputs generated by managed entities called DMUs (=Decision Making Units). Explicit formulation of underlying functional relations with specified parametric forms relating inputs to outputs is not required. An overall (scalar) measure of efficiency is also obtained for each DMU from the observed values of its multiple inputs and outputs without requiring uses of a priori weights. There are many different ways of specifying DEA reference sets. A partition into 6 classes is provided for such observations in which 3 are scale inefficient and 3 are scale efficient with the latter containing substs of DMUs that are also technically (=zero waste) efficient.     

Finding DEA-efficient hyperplanes using MOLP efficient faces

This paper suggests a method for finding efficient hyperplanes with variable returns to scale the technology in data envelopment analysis (DEA) by using the multiple objective linear programming (MOLP) structure. By presenting an MOLP problem for finding the gradient of efficient hyperplanes, We characterize the efficient faces. Thus, without finding the extreme efficient points of the MOLP problem and only by identifying the efficient faces of the MOLP problem, we characterize the efficient hyperplanes which make up the DEA efficient frontier. Finally, we provide an algorithm for finding the efficient supporting hyperplanes and efficient defining hyperplanes, which uses only one linear programming problem.     

A new method for complete ranking of DMUs

So far numerous models have been proposed for ranking the efficient decision-making units (DMUs) in data envelopment analysis (DEA). But, the most shortcoming of these models is their two-stage orientation. That is, firstly we have to find efficient DMUs and then rank them. Another flaw of some of these models, like AP-model (A procedure for ranking efficient units in data envelopment analysis, Management Science, 39 (10) (1993) 1261–1264), is existence of a non-Archimedean number in their objective function. Besides, when there is more than one weak efficient unit (or non-extreme efficient unit) these models could not rank DMUs. In this paper, we employ hyperplanes of the production possibility set (PPS) and propose a new method for complete ranking of DMUs in DEA. The proposed approach is a one stage method which ranks all DMUs (efficient and inefficient). In addition to ranking, the proposed method determines the type of efficiency for each DMU, simultaneously. Numerical examples are given to show applicability of the proposed method.