An MOLP based procedure for finding efficient units in DEA models

In this paper a multiple objective linear programming (MOLP) problem whose feasible region is the production possibility set with variable returns to scale is proposed. By solving this MOLP problem by multicriterion simplex method, the extreme efficient Pareto points can be obtained. Then the extreme efficient units in data envelopment analysis (DEA) with variable returns to scale, considering the specified theorems and conditions, can be obtained. Therefore, by solving the proposed MOLP problem, the non-dominant units in DEA can be found. Finally, a numerical example is provided.     

Target setting in data envelopment analysis using MOLP

Data envelopment analysis (DEA) and multiple objective linear programming (MOLP) can be used as tools in management control and planning. The existing models have been established during the investigation of the relations between the output-oriented dual DEA model and the minimax reference point formulations, namely the super-ideal point model, the ideal point model and the shortest distance model. Through these models, the decision makers’ preferences are considered by interactive trade-off analysis procedures in multiple objective linear programming. These models only consider the output-oriented dual DEA model, which is a radial model that focuses more on output increase. In this paper, we improve those models to obtain models that address both inputs and outputs. Our main aim is to decrease total input consumption and increase total output production which results in solving one mathematical programming model instead of n models. Numerical illustration is provided to show some advantages of our method over the previous methods.     

Target setting in the general combined-oriented CCR model using an interactive MOLP method

The traditional data envelopment analysis (DEA) model does not include a decision maker’s (DM) preference structure while measuring relative efficiency, with no or minimal input from the DM. To incorporate DM’s preference information in DEA, various techniques have been proposed. An interesting method to incorporate preference information, without necessary prior judgment, is the use of an interactive decision making technique that encompasses both DEA and multi-objective linear programming (MOLP). In this paper, we will use Zionts-Wallenius (Z-W) method to reflecting the DM’s preferences in the process of assessing efficiency in the general combined-oriented CCR model. A case study will conducted to illustrate how combined-oriented efficiency analysis can be conducted using the MOLP method.     

Finding strong defining hyperplanes of PPS using multiplier form

The production possibility set (PPS) is defined as the set of all inputs and outputs of a system in which inputs can produce outputs. In this paper, we deal with the problem of finding the strong defining hyperplanes of the PPS. These hyperplanes are equations that form efficient surfaces. It is well known that the optimal solutions of the envelopment formulation for extreme efficient units are often highly degenerate and, therefore, may have alternate optima for the multiplier form. Every optimal solution of the multiplier form yields a hyperplane which is supporting at the PPS. We will show that the hyperplane which corresponds to an extreme optimal solution of the multiplier form (in evaluating an efficient DMU), and whose components corresponding to inputs and outputs are non zero is a strong defining hyperplane of the PPS. This will be discussed in details in this paper. These hyperplanes are useful in sensitivity and stability analysis, the status of returns to scale of a DMU, incorporating performance into the efficient frontier analysis, and so on. Using numerical examples, we will demonstrate how to use the results.     

Integrating DEA-oriented performance assessment and target setting using interactive MOLP methods

Data envelopment analysis (DEA) and multiple objective linear programming (MOLP) are tools that can be used in management control and planning. Whilst these two types of model are similar in structure, DEA is directed to assessing past performances as part of management control function and MOLP to planning future performance targets. This paper is devoted to investigating equivalence models and interactive tradeoff analysis procedures in MOLP, such that DEA-oriented performance assessment and target setting can be integrated in a way that the decision makers’ preferences can be taken into account in an interactive fashion. Three equivalence models are investigated between the output-oriented dual DEA model and the minimax reference point formulations, namely the super-ideal point model, the ideal point model and the shortest distance model. These models can be used to support efficiency analysis in the same way as the conventional DEA model does and also support tradeoff analysis for setting target values by individuals or groups. A case study is conducted to illustrate how DEA-oriented efficiency analysis can be conducted using the MOLP methods and how such performance assessment can be integrated into an interactive procedure for setting realistic target values.     

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.     

A modified method for constructing efficient solutions structure of MOLP

This paper deals with a recently proposed algorithm for obtaining all weak efficient and efficient solutions in a multi objective linear programming (MOLP) problem. The algorithm is based on solving some weighted sum problems, and presents an easy and clear solution structure. We first present an example to show that the algorithm may fail when at least one of these weighted sum problems has not a finite optimal solution. Then, the algorithm is modified to overcome this problem. The modified algorithm determines whether an efficient solution exists for a given MOLP and generates the solution set correctly (if exists) without any change in the complexity.     

Finding all maximal efficient faces in multiobjective linear programming

An algorithm for finding the whole efficient set of a multiobjective linear program is proposed. From the set of efficient edges incident to a vertex, a characterization of maximal efficient faces containing the vertex is given. By means of the lexicographic selection rule of Dantzig, Orden and Wolfe, a connectedness property of the set of dual optimal bases associated to a degenerate vertex is proved. An application of this to the problem of enumerating all the efficient edges incident to a degenerate vertex is proposed. Our method is illustrated with numerical examples and comparisons with Armand—Malivert's algorithm show that this new algorithm uses less computer time.     

Integrated bank performance assessment and management planning using hybrid minimax reference point – DEA approach

The purpose of assessing past performances and setting future targets for an organisation such as a bank branch is to find where the branch stands in comparison to its peers within the bank branch network and how to improve the efficiency of its operations relatively when compared to the best practice branches. However, future performance targets may be set arbitrarily by the head-office and thus could be unrealistic and not achievable by a branch. A hybrid minimax reference point-data envelopment analysis (HMRP-DEA) approach is investigated to incorporate the value judgements of both branch managers and head-office directors and to search for the most preferred solution (MPS) along the efficient frontier for each bank branch. The HMRP-DEA approach is composed of three minimax models, including the super-ideal point model, the ideal point model and the shortest distance model, which share the same decision and objective spaces, are different from each other only in their reference points and weighting schema, and are proven to be equivalent to the output-oriented DEA dual models. These models are examined both analytically and graphically in this paper using a case study, which provides the unprecedented insight into integrated efficiency and trade-off analyses. The HMRP-DEA approach uses DEA as an ex-post-facto evaluation tool for past performance assessment and the minimax reference point approach as an ex-ante planning tool for future performance forecasting and target setting. Thus, the HMRP-DEA approach provides an alternative means for realistic target setting and better resource allocation. It is examined by a detailed investigation into the performance analysis for the fourteen branches of an international bank in the Greater Manchester area.     

Ranking efficient DMUs using the Tchebycheff norm

One problem that has been discussed frequently in data envelopment analysis (DEA) literature has been lack of discrimination in DEA applications, in particular when there are insufficient DMUs or the number of inputs and outputs is too high relative to the number of units. This is an additional reason for the growing interest in complete ranking techniques. In this paper a method for ranking extreme efficient decision making units (DMUs) is proposed. The method uses L_∞(or Tchebycheff) Norm, and it seems to have some superiority over other existing methods, because this method is able to remove the existing difficulties in some methods, such as Andersen and Petersen [2] (AP) that it is sometimes infeasible. The suggested model is always feasible.     

An occurrence of multiple projections in DEA-based measurement of technical efficiency: Theoretical comparison among DEA models from desirable properties

This study discusses nine desirable properties that a measure of technical efficiency (TE) needs to satisfy from the perspective of production economics and optimization. Seven data envelopment analysis (DEA) models are theoretically compared from a viewpoint of nine TE criteria. All the seven DEA models suffer from a problem of multiple projections even though a unique projection for efficiency comparison is one of the nine desirable properties. Furthermore, all the DEA models violate the property on aggregation of inputs and outputs. Thus, the seven DEA models do not satisfy all desirable TE properties. In addition, the comparison provides us with the following guidelines: (a) The additive model violates all desirable TE properties. (b) Russell measure and SBM (=ERGM) perform as well as RAM as a non-radial measure. If we are interested in strict monotonicity, the two models outperform the other DEA models including RAM. In contrast, if we are interested in translation invariance, RAM is better than Russell measure and SBM (=ERGM). (c) The radial measures (CCR and BCC) have the property of linear homogeneity. (d) The CCR model is useful for measuring a frontier shift among different periods. (e) If a data set contains a negative value, RAM becomes a DEA model to handle the negative value because it has the property of translation invariance. After examining the desirable TE properties, this study proposes a new approach to deal with an occurrence of multiple projections. The proposed approach includes a test to examine an occurrence of multiple projections, a mathematical expression of a projection set, and a selection process of a unique reference set as the largest one covering all the possible reference sets.     

Identifying the anchor points in DEA using sensitivity analysis in linear programming

In this paper, the anchor points in DEA, as an important subset of the set of extreme efficient points of the production possibility set (PPS), are studied. A basic definition, utilizing the multiplier DEA models, is given. Then, two theorems are proved which provide necessary and sufficient conditions for characterization of these points. The main results of the paper lead to a new interesting connection between DEA and sensitivity analysis in linear programming theory. By utilizing the established theoretical results, a successful procedure for identification of the anchor points is presented.     

Inverse DEA under inter-temporal dependence using multiple-objective programming

This paper deals with the inverse Data Envelopment Analysis (DEA) under inter-temporal dependence assumption. Both problems, input-estimation and output-estimation, are investigated. Necessary and sufficient conditions for input/output estimation are established utilizing Pareto and weak Pareto solutions of linear multiple-objective programming problems. Furthermore, in this paper we introduce a new optimality notion for multiple-objective programming problems, periodic weak Pareto optimality. These solutions are used in inverse DEA, and it is shown that these can be characterized by a simple modification in weighted sum scalarization tool.     

Solving a full fuzzy linear programming using lexicography method and fuzzy approximate solution

This paper discusses full fuzzy linear programming (FFLP) problems of which all parameters and variable are triangular fuzzy numbers. We use the concept of the symmetric triangular fuzzy number and introduce an approach to defuzzify a general fuzzy quantity. For such a problem, first, the fuzzy triangular number is approximated to its nearest symmetric triangular number, with the assumption that all decision variables are symmetric triangular. An optimal solution to the above-mentioned problem is a symmetric fuzzy solution. Every FLP models turned into two crisp complex linear problems; first a problem is designed in which the center objective value will be calculated and since the center of a fuzzy number is preferred to (its) margin. With a special ranking on fuzzy numbers, the FFLP transform to multi objective linear programming (MOLP) where all variables and parameters are crisp.     

Finding all efficient extreme points for multiple objective linear programs

In this paper we develop a method for finding all efficient extreme points for multiple objective linear programs. Simple characterizations of the efficiency of an edge incident to a nondegenerate or a degenerate efficient vertex are given. These characterizations form the basis of an algorithm for enumerating all efficient vertices. The algorithm appears to have definite computational advantages over other methods. Some illustrative examples are included.     

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.