Using Zionts–Wallenius method to improve estimate of value efficiency in DEA

Halme et al. [M. Halme, T. Joro, P. Korhonen, S. Salo, J. Wallenius, A value efficiency approach to incorporating preference information in data envelopment analysis, Management Science 45 (1) (1999) 103-115] proposed value efficiency analysis as an approach to incorporate preference information in Data Envelopment Analysis (DEA). In this paper, we develop some related concepts, and present a refinement to Halme et al.’s approach to measure value efficiency scores more precisely. For do this, we will introduce an MOLP model which its objective functions are input/output variables subject to the defining constraints of Production Possibility Set (PPS) of DEA models. Then by using the so-called Zionts–Wallenius method, we aid the Decision Maker (DM) in searching for the Most Preferred Solution (MPS) and generating input/output weights as the DM’s underlying value structure about objective functions. Finally, value efficiency scores are calculated by comparing the inefficient units to units having the same value as the MPS.     

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.     

Experiments with an interactive paired comparison simplex method for molp problems

In this paper, an interactive paired comparison simplex based method formultiple objective linear programming (MOLP) problems is developed and compared to other interactive MOLP methods. The decision maker (DM)’s utility function is assumed to be unknown, but is an additive function of his known linearized objective functions. A test for ‘utility efficiency’ for MOLP problems is developed to reduce the number of efficient extreme points generated and the number of questions posed to the DM. The notion of ‘strength of preference ’ is developed for the assessment of the DM’s unknown utility function where he can express his preference for a pair of extreme points as ‘strong ’, ‘weak ’, or ‘almost indifferent ’. The problem of ‘inconsistency of the DM’ is formalized and its resolution is discussed. An example of the method and detailed computational results comparing it with other interactive MOLP methods are presented. Several performance measures for comparative evaluations of interactive multiple objective programming methods are also discussed. All rights reserved. This study, or parts thereof, may not be reproduced in any form without written permission of the authors.     

A posterior preference articulation approach to multiresponse surface optimization

In multiresponse surface optimization (MRSO), responses are often in conflict. To obtain a satisfactory compromise, the preference information of a decision maker (DM) on the tradeoffs among the responses should be incorporated into the problem. In most existing work, the DM expresses a subjective judgment on the responses through a preference parameter before the problem-solving process, after which a single solution is obtained. In this study, we propose a posterior preference articulation approach to MRSO. The approach initially finds a set of nondominated solutions without the DM’s preference information, and then allows the DM to select the best solution from among the nondominated solutions. An interactive selection method based on pairwise comparisons made by the DM is adopted in our method to facilitate the DM’s selection process. The proposed method does not require that the preference information be specified in advance. It is easy and effective in that a satisfactory compromise can be obtained through a series of pairwise comparisons, regardless of the type of the DM’s utility function.     

An interactive desirability function method to multiresponse optimization

Multiresponse optimization problems often involve incommensurate and conflicting responses. To obtain a satisfactory compromise in such a case, a decision maker (DM)’s preference information on the tradeoffs among the responses should be incorporated into the problem. This paper proposes an interactive method based on the desirability function approach to facilitate the preference articulation process. The proposed method allows the DM to adjust any of the preference parameters, namely, the shape, bound, and target of a desirability function in a single, integrated framework. The proposed method would be highly effective in generating a compromise solution that is faithful to the DM’s preference structure.     

Stochastic multiobjective acceptability analysis for the Choquet integral preference model and the scale construction problem

The Choquet integral preference model is adopted in Multiple Criteria Decision Aiding (MCDA) to deal with interactions between criteria, while the Stochastic Multiobjective Acceptability Analysis (SMAA) is an MCDA methodology considered to take into account uncertainty or imprecision on the considered data and preference parameters. In this paper, we propose to combine the Choquet integral preference model with the SMAA methodology in order to get robust recommendations taking into account all parameters compatible with the preference information provided by the Decision Maker (DM). In case the criteria are on a common scale, one has to elicit only a set of non-additive weights, technically a capacity, compatible with the DM’s preference information. Instead, if the criteria are on different scales, besides the capacity, one has to elicit also a common scale compatible with the preferences given by the DM. Our approach permits to explore the whole space of capacities and common scales compatible with the DM’s preference information.     

Non-additive robust ordinal regression: A multiple criteria decision model based on the Choquet integral

Within the multicriteria aggregation–disaggregation framework, ordinal regression aims at inducing the parameters of a decision model, for example those of a utility function, which have to represent some holistic preference comparisons of a Decision Maker (DM). Usually, among the many utility functions representing the DM’s preference information, only one utility function is selected. Since such a choice is arbitrary to some extent, recently robust ordinal regression has been proposed with the purpose of taking into account all the sets of parameters compatible with the DM’s preference information. Until now, robust ordinal regression has been implemented to additive utility functions under the assumption of criteria independence. In this paper we propose a non-additive robust ordinal regression on a set of alternatives A, whose utility is evaluated in terms of the Choquet integral which permits to represent the interaction among criteria, modelled by the fuzzy measures, parameterizing our approach.     

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.     

Multiple criteria sorting with a set of additive value functions

We present a new multiple criteria sorting method that aims at assigning actions evaluated on multiple criteria to p pre-defined and ordered classes. The preference information supplied by the decision maker (DM) is a set of assignment examples on a subset of actions relatively well known to the DM. These actions are called reference actions. Each assignment example specifies a desired assignment of a corresponding reference action to one or several contiguous classes. The set of assignment examples is used to build a preference model of the DM represented by a set of general additive value functions compatible with the assignment examples. For each action a, the method computes two kinds of assignments to classes, concordant with the DM’s preference model: the necessary assignment and the possible assignment. The necessary assignment specifies the range of classes to which the action can be assigned considering all compatible value functions simultaneously. The possible assignment specifies, in turn, the range of classes to which the action can be assigned considering any compatible value function individually. The compatible value functions and the necessary and possible assignments are computed through the resolution of linear programs.     

Sensitivity analysis for product design selection with an implicit value function

In product design selection the decision maker (DM) often does not have enough information about the end users’ needs to state the “preferences” with precision, as is required by many of the existing selection methods. We present, for the case where the DM gives estimates of the preferences, a concept for calculating a “robustness index.” The concept can be used with any iterative selection method that chooses a trial design for each iteration, and uses the DM’s preference parameters at that trial design to eliminate some design options which have lower value than the trial design. Such methods, like our previously published method, are applicable to cases where the DM’s value function is implicit. Our robustness index is a metric of the allowed variation between the actual and estimated preferences for which the set of non-eliminated trial designs (which could be singleton) will not change. The DM, through experience, can use the robustness index and other information generated in calculating the index to determine what action to take: make a final selection from the present set of non-eliminated designs; improve the precision of the preference estimates; or otherwise cope with the imprecision. We present an algorithm for finding the robustness index, and demonstrate and verify the algorithm with an engineering example and a numerical example.     

Multiobjective data envelopment analysis

Data envelopment analysis (DEA) is popularly used to evaluate relative efficiency among public or private firms. Most DEA models are established by individually maximizing each firm's efficiency according to its advantageous expectation by a ratio. Some scholars have pointed out the interesting relationship between the multiobjective linear programming (MOLP) problem and the DEA problem. They also introduced the common weight approach to DEA based on MOLP. This paper proposes a new linear programming problem for computing the efficiency of a decision-making unit (DMU). The proposed model differs from traditional and existing multiobjective DEA models in that its objective function is the difference between inputs and outputs instead of the outputs/inputs ratio. Then an MOLP problem, based on the introduced linear programming problem, is formulated for the computation of common weights for all DMUs. To be precise, the modified Chebychev distance and the ideal point of MOLP are used to generate common weights. The dual problem of this model is also investigated. Finally, this study presents an actual case study analysing R&D efficiency of 10 TFT-LCD companies in Taiwan to illustrate this new approach. Our model demonstrates better performance than the traditional DEA model as well as some of the most important existing multiobjective DEA models.     

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.     

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.     

PROMISE: A DSS for multiple objective stochastic linear programming problems

Most of the multiple objective linear programming (MOLP) methods which have been proposed in the last fifteen years suppose deterministic contexts, but because many real problems imply uncertainty, some methods have been recently developed to deal with MOLP problems in stochastic contexts. In order to help the decision maker (DM) who is placed before such stochastic MOLP problems, we have built a Decision Support System called PROMISE. On the one hand, our DSS enables the DM to identify many current stochastic contexts: risky situations and also situations of partial uncertainty. On the other hand, according to the nature of the uncertainty, our DSS enables the DM to choose the most appropriate interactive stochastic MOLP method among the available methods, if such a method exists, and to solve his problem via the chosen method.     

Applying inverse DEA and cone constraint to sensitivity analysis of DMUs with undesirable inputs and outputs

In this paper, the inverse data envelopment analysis (DEA) with the preference of cone constraints will be discussed in a way that in the decision-making units, the undesirable inputs and outputs exist simultaneously. Supposing that the efficiency level does not change, if the unit under assessment increases the level of the desirable outputs and decreases the level of the undesirable outputs, how will it affect the amount of the desirable input level and the undesirable input level? To answer this question, the application of the inverse DEA with preference of cone constraints is suggested. The suggested approach, while maintaining the efficiency level, increases the level of its undesirable input and decreases the level of its desirable input by selection of strongly efficient solutions or some weakly efficient solutions of the multiple objective linear programming (MOLP) model. While maintaining the efficiency level, the suggested approach by selection of strongly efficient solution or some of the weakly efficient solutions of the MOLP model can increase the undesirable input level and decrease the desirable input level. Similarly, the suggested approach can be applied if the decision-making unit increases its undesirable input level and decreases the desirable input level so that the undesirable output level decreases and the desirable output level increases while maintaining the efficiency level. As an illustration, two numerical examples are rendered.     

Duality,efficiency computations and interpretations in imprecise DEA

Data envelopment analysis (DEA) has proven to be a useful tool for assessing efficiency or productivity of organizations which is of vital practical importance in managerial decision making. While DEA assumes exact input and output data, the development of imprecise DEA (IDEA) broadens the scope of applications to efficiency evaluations involving imprecise information which implies various forms of ordinal and bounded data possibly or often occurring in practice. The primary purpose of this article is to characterize the variable efficiency in IDEA. Since DEA describes a pair of primal and dual models, also called envelopment and multiplier models, we can basically consider two IDEA models: One incorporates imprecise data into envelopment model and the other includes the same imprecise data in multiplier model. The issues of rising importance are thus the relationships between the two models and how to solve them. The groundwork we will make includes a duality study, which makes it possible to characterize the efficiency solutions from the two models and link with the efficiency bounds and classifications that some of the published IDEA studies have done. The other purposes are to present computational aspects of the efficiency bounds and how to interpret the efficiency solutions. The computational method developed here extends the previous IDEA method to effectively incorporate a more general form of strict ordinal data and partial orders in its framework, which in turn overcomes some drawbacks of the previous approaches. The interpretation of the resulting efficiency is also important but we have never seen it before.     

DEA models for resource reallocation and production input/output estimation

This paper discusses the “inverse” data envelopment analysis (DEA) problem with preference cone constraints. An inverse DEA model can be used for a decision making unit (DMU) to estimate its input/output levels when some or all of its input/output entities are revised, given its current DEA efficiency level. The extension of introducing additional preference cones to the previously developed inverse DEA model allows the decision makers to incorporate their preferences or important policies over inputs/outputs into the production analysis and resource allocation process. We provide the properties of the inverse DEA problem through a discussion of its related multi-objective and weighted sum single-objective programming problems. Numerical examples are presented to illustrate the application procedure of our extended inverse DEA model. In particular, we demonstrate how to apply the model to the case of a local home electrical appliance group company for its resource reallocation decisions.     

On Method for Uncertain Multiple Attribute Decision Making Problems with Uncertain Multiplicative Preference Information on Alternatives

The uncertain multiple attribute decision making (UMADM) problems are investigated, in which the information about attribute weights is known partly and the attribute values take the form of interval numbers, and the decision maker (DM) has uncertain multiplicative preference information on alternatives. We make the decision information uniform by using a transformation formula, and then establish an objective-programming model. The attribute weights can be determined by solving the developed model. The concept of interval positive ideal point of alternatives (IPIPA) is introduced, and an approach based on IPIPA and projection to ranking alternatives is proposed. The method can avoid comparing and ranking interval numbers, and can reflect both the objective information and the DMs subjective preferences.     

A multiple criteria approach to data envelopment analysis

In this paper, we present a Multiple Criteria Data Envelopment Analysis (MCDEA) model which can be used to improve discriminating power of DEA methods and also effectively yield more reasonable input and output weights without a priori information about the weights. In the proposed model, several different efficiency measures, including classical DEA efficiency, are defined under the same constraints. Each measure serves as a criterion to be optimized. Efficiencies are then evaluated under the framework of multiple objective linear programming (MOLP). The method is illustrated through three examples in which data sets are taken from previous research on DEA's discriminating power and weight restriction.     

Multi-objective stochastic programming for portfolio selection

Generally, in the portfolio selection problem the Decision Maker (DM) considers simultaneously conflicting objectives such as rate of return, liquidity and risk. Multi-objective programming techniques such as goal programming (GP) and compromise programming (CP) are used to choose the portfolio best satisfying the DM’s aspirations and preferences. In this article, we assume that the parameters associated with the objectives are random and normally distributed. We propose a chance constrained compromise programming model (CCCP) as a deterministic transformation to multi-objective stochastic programming portfolio model. CCCP is based on CP and chance constrained programming (CCP) models. The proposed program is illustrated by means of a portfolio selection problem from the Tunisian stock exchange market.