On finding the most BCC-efficient DMU: A new integrated MIP–DEA model

This paper proposes a new integrated mixed integer programing – data envelopment analysis (MIP–DEA) model to improve the integrated DEA model which was introduced by Toloo & Nalchigar [M. Toloo, S. Nalchigar. A new integrated DEA model for finding most BCC–efficient DMU. Appl. Math. Model. 33 (2009) 597–60]. In this study some problems of applying Toloo & Nalchigar’s model are addressed. A new integrated MIP–DEA model is then introduced to determine the most BCC-efficient decision making unit (DMU). Moreover, it is mathematically proved that the new model identifies only a single BCC-efficient DMU by a common set of optimal weights. To show applicability of proposed models, a numerical example is used which contains a real data set of nineteen facility layout designs (FLDs).     

The role of non-Archimedean epsilon in finding the most efficient unit: With an application of professional tennis players

The determination of a single efficient decision making unit (DMU) as the most efficient unit has been attracted by decision makers in some situations. Some integrated mixed integer linear programming (MILP) and mixed integer nonlinear programming (MINLP) data envelopment analysis (DEA) models have been proposed to find a single efficient unit by the optimal common set of weights. In conventional DEA models, the non-Archimedean infinitesimal epsilon, which forestalls weights from being zero, is useless if one utilizes the well-known two-phase method. Nevertheless, this approach is inapplicable to integrated DEA models. Unfortunately, in some proposed integrated DEA models, the epsilon is neither considered nor determined. More importantly, based on this lack some approaches have been developed which will raise this drawback.In this paper, first of all some drawbacks of these models are discussed. Indeed, it is shown that, if the non-Archimedean epsilon is ignored, then these models can neither find the most efficient unit nor rank the extreme efficient units. Next, we formulate some new models to capture these drawbacks and hence attain assurance regions. Finally, a real data set of 53 professional tennis players is applied to illustrate the applicability of the suggested models.     

A revised and generalized model with improved discrimination for finding most efficient DMUs in DEA

In this paper we first propose a generalized model which in its special case revises a recently proposed model for finding most BCC-efficient DMU. Then, by explaining about the drawbacks of existing approaches, an algorithm will be developed to consider all possible alternative optimal solutions and determine the set of most efficient DMUs. Another model also will be proposed to provide more discrimination which can be used to select a single most efficient DMU, when it is desirable. The proposed approaches of this paper are applicable for all assumptions about returns-to-scale, and can be utilized to select a DMU or provide a full ranking of DMUs. The contents of the paper are illustrated through numerical examples.     

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.     

A new integrated DEA model for finding most BCC-efficient DMU

In many applications of widely recognized technique, DEA, finding the most efficient DMU is desirable for decision maker. Using basic DEA models, decision maker is not able to identify most efficient DMU. Amin and Toloo [Gholam R. Amin, M. Toloo, Finding the most efficient DMUs in DEA: an improved integrated model. Comput. Ind. Eng. 52 (2007) 71–77] introduced an integrated DEA model for finding most CCR-efficient DMU. In this paper, we propose a new integrated model for determining most BCC-efficient DMU by solving only one linear programming (LP). This model is useful for situations in which return to scale is variable, so has wider range of application than other models which find most CCR-efficient DMU. The applicability of the proposed integrated model is illustrated, using a real data set of a case study, which consists of 19 facility layout alternatives.     

Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming

This paper extends the works by Olesen and Petersen (2003), Russell and Schworm (2006) and Cooper et al. (2007) about describing the efficient frontier of a production possibility set by the intersection of a finite number of closed halfspaces, in several ways. First, we decompose the efficient frontier into a smallest number of convex polyhedrons, or equivalently into a new class of efficient faces, called maximal efficient faces (MEFs). Second, we show how to identify all MEFs even if full dimensional efficient faces do not exist. Third, by applying the MEF decomposition to various real-world data sets, we demonstrate the validity of the MEF decomposition and how it can contribute to the DEA literature. Finally, we illustrate how to use the identified MEFs in practice.     

Ranking decision-making units using common weights in DEA

Data envelopment analysis (DEA) is a linear programming technique that is used to measure the relative efficiency of decision-making units (DMUs). Liu et al. (2008) [13] used common weights analysis (CWA) methodology to generate a CSW using linear programming. They classified the DMUs as CWA-efficient and CWA-inefficient DMUs and ranked the DMUs using CWA-ranking rules. The aim of this study is to show that the criteria used by Liu et al. are not theoretically strong enough to discriminate among the CWA-efficient DMUs with equal efficiency. Moreover, there is no guarantee that their proposed model can select one optimal solution from the alternative components. The optimal solution is considered to be the only unique optimal solution. This study shows that the proposal by Liu et al. is not generally correct. The claims made by the authors against the theorem proposed by Liu et al. are fully supported using two counter examples.     

Cross-efficiency aggregation in DEA models using the evidential-reasoning approach

Cross-efficiency in data envelopment analysis (DEA) models is an effective way to rank decision-making units (DMUs). The common methods to aggregate cross-efficiency do not consider the preference structure of the decision maker (DM). When a DM’s preference structure does not satisfy the “additive independence” condition, a new aggregation method must be proposed. This paper uses the evidential-reasoning (ER) approach to aggregate the cross-efficiencies obtained from cross-evaluation through the transformation of the cross-efficiency matrix to pieces of evidence. This paper provides a new method for cross-efficiency aggregation and a new way for DEA models to reflect a DM’s preference or value judgments. Additionally, this paper presents examples that demonstrate the features of cross-efficiency aggregation using the ER approach, including an empirical example of the evaluation practice of 16 basic research institutes in Chinese Academy of Sciences (CAS) in 2010 that illustrates how the ER approach can be used to aggregate the cross-efficiency matrix produced from DEA models.     

Preference aggregation and DEA: An analysis of the methods proposed to discriminate efficient candidates

There are different ways to allow the voters to express their preferences on a set of candidates. In ranked voting systems, each voter selects a subset of the candidates and ranks them in order of preference. A well-known class of these voting systems are scoring rules, where fixed scores are assigned to the different ranks and the candidates with the highest score are the winners. One of the most important issues in this context is the choice of the scoring vector, since the winning candidate can vary according to the scores used. To avoid this problem, Cook and Kress [W.D. Cook, M. Kress, A data envelopment model for aggregating preference rankings, Management Science 36 (11) (1990) 1302–1310], using a DEA/AR model, proposed to assess each candidate with the most favorable scoring vector for him/her. However, the use of this procedure often causes several candidates to be efficient, i.e., they achieve the maximum score. For this reason, several methods to discriminate among efficient candidates have been proposed. The aim of this paper is to analyze and show some drawbacks of these methods.     

Validating DEA as a ranking tool: An application of DEA to assess performance in higher education

There is a general interest in ranking schemes applied to complex entities described by multiple attributes. Published rankings for universities are in great demand but are also highly controversial. We compare two classification and ranking schemes involving universities; one from a published report, ‘Top American Research Universities’ by the University of Florida's TheCenter and the other using DEA. Both approaches use the same data and model. We compare the two methods and discover important equivalences. We conclude that the critical aspect in classification and ranking is the model. This suggests that DEA is a suitable tool for these types of studies.     

A new robust mixed integer-valued model in DEA

The mixed integer linear programming (MILP) models are proposed to estimate the performance of decision making units (DMUs) including both integer and real values in data envelopment analysis (DEA). There are several studies to propose MILPs in the literature of DEA; however, they have some major shortcomings unfortunately. This study firstly mentioned the shortcomings in the previous researches and secondly suggests a robust MILP based on the Kourosh and Arash Method (KAM). The proposed linear model, integer-KAM (IKAM), has almost all capabilities of the linear KAM and significantly removes the shortcomings in the current MILPs. For instance, IKAM benchmarks and ranks all technically efficient and inefficient DMUs at the same time. It detects outliers, and estimates the production frontier significantly. A numerical example of 39 Spanish airports with four integer inputs and three outputs including two integer values and a real value also represents the validity of the statements.     

A heuristic multi-start decomposition approach for optimal design of serial machining lines

We study an optimal design problem for serial machining lines. Such lines consist of a sequence of stations. At every station, the operations to manufacture a product are grouped into blocks. The operations within each block are performed simultaneously by the same spindle head and the blocks of the same station are executed sequentially. The inclusion and exclusion constraints for combining operations into blocks and stations as well as the precedence constraints on the set of operations are given. The problem is to group the operations into blocks and stations minimizing the total line cost. A feasible solution must respect the given cycle time and all given constraints. In this paper, a heuristic multi-start decomposition approach is proposed. It utilizes a decomposition of the initial problem into several sub-problems on the basis of a heuristic solution. Then each obtained sub-problem is solved by an exact algorithm. This procedure is repeated many times, each time it starts with a new heuristic solution. Computational tests show that the proposed approach outperforms simple heuristic algorithms for large-scale problems.     

基于参数设计的信噪比交叉效率评价方法

针对DEA交叉效率评价过程中没有考虑自评与互评效率的作用而主观赋予相同权重导致交叉效率评价值不准确的问题.文章基于参数设计的思想,依据试验设计中可控与不可控因素的作用机理区分自评权重和互评权重对所评价决策单元交叉效率的影响与作用,将其界定为可控与不可控因素的管理学属性,明确不同权重作用机理;引入信噪比作为衡量决策单元交...     

在DEA中有关输出与输入的比值的模型的探讨

对以决策单元的输出与输入的比值为目标函数的多目标规划模型,证明了有关它与(弱)DEA有效(C2R)关系的三个定理.     

New approach for the assignment of new European agricultural subsidies using scores from data envelopment analysis: Application to olive-growing farms in Andalusia (Spain)

More than 60% of olive-growing farms in Andalusia (Spain) would have negative returns without European agricultural subsidies. Agenda 2000 criteria imply that agricultural subsidies currently play the role of enhancing the production quality and the environmental and social values of agriculture. Although the necessity of the modulation of subsidies is stated, the EU regulations do not state which objective criteria should be used or how they should be measured, despite the fact that regulations demand objectivity in this measurement.