相关论文: A linear programming based approach for determinin…

In data envelopment analysis (DEA), the occurrence of multiple reference sets is a crucial issue in identifying all the reference DMUs to a given decision making unit (DMU). To resolve this difficulty, we introduce the useful notion of…

In data envelopment model (DEA), while either the most or least distance based frameworks can be implemented for targeting, the latter is often more relevant than the former from a managerial point of view due to easy attainability of the…

It is well established that multiple reference sets may occur for a decision making unit (DMU) in the non-radial DEA (data envelopment analysis) setting. As our first contribution, we differentiate between three types of reference set.…

Data envelopment analysis (DEA) is a linear program (LP)-based method used to determine the efficiency of a decision making unit (DMU), which transforms inputs to outputs, by peer comparison. This paper presents a new computation algorithm…

The recent study by [Mehdiloozad, Mirdehghan, Sahoo, & Roshdi (2015) On the identification of the global reference set in data envelopment analysis. EJOR, 245, 779-788] proposes a linear programming (LP) model for the problem of finding the…

In data envelopment analysis (DEA) literature, the returns to scale (RTS) of an inefficient decision making unit (DMU) is determined at its projected point on the efficient frontier. Under the occurrences of multiple projection points,…

In this paper, we reveal a new characterization of the super-efficiency model for Data Envelopment Analysis (DEA). In DEA, the efficiency of each decision making unit (DMU) is measured by the ratio the weighted sum of outputs divided by the…

Decision-making units (DMUs) in a group convert the same resources (i.e., input indices) into the same products (i.e., output indices) at different scales. Performance indices have different measurement units, and their market prices per…

We propose a novel DEA ranking based on a robust optimization viewpoint: the higher ranking for those DMU's that remain efficient even for larger variations of data and vice versa. This ranking can be computed by solving generalized linear…

Estimating a constrained relation is a fundamental problem in machine learning. Special cases are classification (the problem of estimating a map from a set of to-be-classified elements to a set of labels), clustering (the problem of…

Existing multi-criteria decision-making (MCDM) methods often face challenges when evaluating a large number of alternatives, leading to skewed results in selecting the optimal choice. Similarly, conventional efficiency analysis (EA)…

In benchmarking, organizations look outward to examine others' performance in their industry or sector. Often, they can learn from the best practices of some of them and improve. In order to develop this idea within the framework of Data…

Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal value function by a set of basis functions and optimize…

Dynamic Selection (DS), where base classifiers are chosen from a classifier's pool for each new instance at test time, has shown to be highly effective in pattern recognition. However, instability and redundancy in the classifier pools can…

The missing data problem has been broadly studied in the last few decades and has various applications in different areas such as statistics or bioinformatics. Even though many methods have been developed to tackle this challenge, most of…

We investigate the problem of best policy identification in discounted linear Markov Decision Processes in the fixed confidence setting under a generative model. We first derive an instance-specific lower bound on the expected number of…

We consider a problem of linear model selection in the presence of both continuous and categorical predictors. Feasible models consist of subsets of numerical variables and partitions of levels of factors. A new algorithm called delete or…

In data envelopment analysis (DEA), the concept of efficiency is examined in either Farrell (DEA) or Pareto senses. In either of these senses, the efficiency status of a decision making unit (DMU) is classified as either weak or strong. It…

This paper proposes a new method to evaluate Decision Making Units (DMUs) under uncertainty using fuzzy Data Envelopment Analysis (DEA). In the proposed multi-objective nonlinear programming methodology both the objective functions and the…

Sufficient numbers of Decision Making Units (DMUs) in comparison with the number of input and output variables has been a concern of using Data Envelopment Analysis (DEA) in the last three decades. There are several studies in the…