# Finding the Most Preferred Decision-Making Unit in Data Envelopment Analysis

Authors: Shirin Mohammadi; S. Morteza Mirdehghan; Gholamreza Jahanshahloo
Journal: Advances in Operations Research
 (2016)

---

## Abstract

Data envelopment analysis (DEA) evaluates the efficiency of the transformation of a decision-making unit’s (DMU’s) inputs into its outputs. Finding the benchmarks of a DMU is one of the important purposes of DEA. The benchmarks of a DMU in DEA are obtained by solving some linear programming models. Currently, the obtained benchmarks are just found by using the information of the data of inputs and outputs without considering the decision-maker’s preferences. If the preferences of the decision-maker are available, it is very important to obtain the most preferred DMU as a benchmark of the under-assessment DMU. In this regard, we present an algorithm to find the most preferred DMU based on the utility function of decision-maker’s preferences by exploring some properties on that. The proposed method is constructed based on the projection of the gradient of the utility function on the production possibility set’s frontier.


---

## Body

## 1. Introduction

Data envelopment analysis (DEA) is a nonparametric approach to assess the relative efficiencies of decision-making units (DMUs). Using some postulates in DEA, a set of possible DMUs is constructed which is called the production possibility set (PPS). One of the well-known postulates to construct the PPS is convexity assumption. If this is done, then the PPS is a convex set and its frontier is considered as an estimation of the production function. The frontier of the PPS is a collection of possible (virtual) DMUs which are weakly efficient, although some of them are strongly efficient. In other words, the frontier of the PPS is divided into two sets: strong efficient frontier and weak efficient frontier. The other DMUs in the PPS which are not on the frontier are inefficient. DEA obtains both efficiency scores and reference (benchmark) units for inefficient DMUs. The reference set for an inefficient DMU consists of all observed efficient DMUs on the efficient surface which the projection of the inefficient DMU lies on. In DEA the reference units are found by projecting a DMU on the efficient frontier. Several models have been presented to find the reference sets in DEA. Thanassoulis and Dyson [1] have proposed a model which is based on the improvements of the weights for input-output levels. Zhu [2] has gathered preference information from decision-maker and then has obtained target by means of these pieces information. Also, Jahanshahloo et al. [3] and Mehdiloozad et al. [4] have proposed two approaches to find the reference set of an inefficient DMU.DEA is a linear programming problem technique to investigate the efficiency status of DMUs. In this regard, some researchers have shown that most of the DEA models are transferred to the multiobjective linear programming (MOLP) models. In other words, the efficient DMUs can be obtained by using an MOLP problem. DEA and MOLP are helpful for managements to draw a plan for future. DEA is used to evaluate the past preferences while MOLP is used for future preferences. The similarities and relations between DEA and MOLP have been discussed by some researchers. Belton and Vickers [5] and Stewart [6] explained the equivalency between DEA and multiple criteria decision analysis (MCDA) formulations. Belton and Stewart [7] found that DEA emphasizes evaluating DMUs and finding targets to improve efficiency while MCDA focuses on ranking based on a set of criteria that include subjective judgment. DEA models do not involve DMU’s preferences to find the efficiency of DMUs. In basic DEA models, the decision-maker’s (DM’s) preferences are not considered to find the benchmark of a DMU. Because of the importance of considering the DM’s preferences, several methods have been proposed to incorporate the DM’s preferences in DEA. Golany [8], Thanassoulis and Dyson [1], Thompson et al. [9], Wong and Beasley [10], and Zhu [2] considered prior preferences of the DM. On the other hand, the MOLP interactive techniques incorporate preference information without requiring prior judgment. Post and Spronk [11], Golany [8], and Joro et al. [12] have been talking about this concept. Wong et al. [13] obtained the relationship between the output-oriented DEA models and min-max formulation. Ebrahimnejad and Hosseinzadeh Lotfi [14] established the equivalence relationship between input- and output-oriented CCR model and the weighted min-max MOLP formulation. Yang and Xu [15] investigated the relationships between DEA and multiobjective optimization models for equivalent efficiency analysis in a multiobjective optimization process.As discussed above, finding the reference of an inefficient DMU is one of the important purposes of DEA. In Golany [8], some of hypothetical or virtual units are obtained and one of them is used as a reference unit. However, some techniques require preference knowledge of decision-makers from the beginning of their techniques such as Wierzbicki [16], Zhu [2], and Thompson et al. [9]. Considering the DM’s preferences is one of the methods to find the reference of a DMU which may be used when the DM’s preferences existed. Yang and Sen [17], Yang [18], and Yang and Li [19] proposed an interactive procedure based on gradient projection to find a most preferred solution (MPS) in multiobjective optimization. MPS can maximize the DM’s preferences. Yang [18] established his paper to present an algorithm to obtain MPS in MOLP problems. Min-max reference point approach and its application for multiobjective problems were established by Yang [20]. Yang et al. [21] used three equivalence models in MOLP, including the super-ideal point model, the ideal point model, and the shortest distance model. These models can be used for setting target values by individuals for groups. Their model can be used to find a normal vector at an efficient solution on the efficient frontier. A normal vector provides information about indifference tradeoff. On the other hand the projection of the gradient of the utility function on the efficient frontier shows a direction to move along a better efficient solution. They used the shortest distance model to find the locally most preferred solution. This point can be considered as a reference with both group and individual DM’s preferences.In this paper, we would like to find the most preferred DMU in the PPS where the utility function of DM’s preferences is available. The method is constructed based on the DEA concepts and models using some MOLP principles. In the proposed method, the gradient vector of the utility function at an efficient DMU is projected on the efficient frontier and, by finding a suitable direction on the frontier, a new efficient DMU is obtained with a better utility function value. This paper is organized as follows. In Section2 some of DEA backgrounds are reviewed. The properties and theories to find the preferred efficient DMU using the gradient projection of the utility function and the normal vectors of the PPS are established in Section 3. An algorithm to find the most preferred DMU is proposed in Section 4 using the utility function and the normal vector of the PPS which is obtained from the multiplier BCC model. A conclusion for research is summarized in Section 5.


## 2. Background of DEA

In this section some fundamental definitions, concepts, and properties in DEA are presented. Suppose that we haven DMUs with m inputs and s outputs. The input and output vectors of DMUj (j=1,…,n) are presented by Xj=(x1j,…,xmj) and Yj=(y1j,…,ysj), respectively. The production possibility set used in this paper is constructed by variable returns to scale, convexity, and possibility (free disposal hull) postulates. This PPS, which is denoted by Tv, is mathematically clarified as follows: (1)Tv=X,Y∣X≥∑j=1nλjXj,Y≤∑j=1nλjYj,∑j=1nλj=1,λj≥0,j=1,2,…,n.Definition 1.
D M U o is efficient if there does not exist any member of the PPS which dominates DMUo. In other words, there does not exist any (X,Y)≠(Xo,Yo) in Tv (PPS) such that X≤Xo and Y≥Yo.There are several DEA models which evaluate DMUs in different point of views. These models generate efficient DMUs by projecting the DMU on the efficient frontier. The criteria of this projection depend on the decision-maker’s perspective. To evaluateDMUp (p∈{1,2,…,n}), the following model, which is called the input-oriented BCC model, can be used:(2)min⁡θs.t∑j=1nλjXj≤θXp,∑j=1nλjYj≥Yp,∑j=1nλj=1,λj≥0,j=1,2,…,n.In this modelθ∗ is the efficiency score of DMUp, where “∗” indicates the optimality of (2). If θ∗=1, then DMUp is a weakly efficient DMU. Furthermore, if all constraints (except nonnegativity inequalities) are binding at optimality, then DMUp is efficient. If θ∗<1, then DMUp is not an efficient DMU and θ∗ shows the amount of the contraction of DMUp’s inputs that it becomes efficient. Let SE be the set of all efficient DMUs. For inefficient DMUp, the reference set is shown by (3)Ep=DMUj∈SE∣λj∗>0,j=1,2,…,n,  in  some  optimal  solutions  of2.The virtual DMU (∑j=1n‍λj∗Xj,∑j=1n‍λj∗Yj) which is on the efficient frontier is called the projection of DMUp on the efficient frontier and can be considered as a target for DMUp. Note that in this target the DM’s preferences have not been considered. The dual of (2) which is called the input-oriented multiplier BCC model is as follows:(4)max⁡UYp+u0s.t.VXP=1,UYj-VXj+u0≤0,j=1,2,…,n,U≥0,V≥0,where U=(u1,…,us) and V=(v1,…,vm) are s and m vectors in R+s and R+m, respectively. DMUp is efficient if there exists an optimal solution of (4) such as (U∗,V∗,u0∗) such that U∗YP+u0∗=1 and (U∗,V∗)>0.Definition 2.
H p : U ∗ Y - V ∗ X + u 0 ∗ = 0 is a supporting hyperplane of the PPS if the following conditions hold:(1)
Hp∩PPS≠∅.(2)
∀(X,Y)((X,Y)∈PPS→U∗Y-V∗X+u0∗≤0).Definition 3.
H is an efficient defining hyperplane of the PPS if it is a supporting hyperplane of the PPS, and there exists at least one affine independent set with m+s elements of efficient DMUs that lie on H.Theorem 4.
If(U∗,V∗,u0∗) is an optimal solution of (4), then Hp:U∗Y-V∗X+u0∗=0 is a supporting hyperplane on the PPS.Proof.
See Cooper et al. [22].Usually, the multiplier BCC model (4) has alternative optimal solutions. Each optimal solution of (4) yields a supporting hyperplane on the PPS. If the optimal solution of (4) is unique, then the corresponding supporting hyperplane is a defining hyperplane and if (4) has alternative optimal solutions, then there are uncountable supporting hyperplanes on the PPS at the projection of DMUp on the efficient frontier in which a finite number of them are defining hyperplanes. Jahanshahloo et al. [23] show that, in evaluating an efficient DMU, each extreme optimal solution of (4) such that (U∗,V∗)>0 identifies an efficient defining hyperplane of the PPS.Theorem 5.
Suppose thatDMUp is efficient. Hp:U∗Y-V∗X+u0∗=0 is an efficient defining hyperplane of the PPS (Tv) if and only if (U∗,V∗,u0∗) is an extreme (basic feasible) optimal solution of (4) in evaluating DMUp with (U∗,V∗)>0.Proof.
see Jahanshahloo et al. [23].Definition 6.
The point that has the minimum value among the inputs and the maximum value among the outputs of all DMUs is called the ideal point and is shown by(XI,YI). In other words, if xiI=min{xi∣(x1,…,xm,y1,…,ys)∈PPS} and yrI=max{yr∣(x1,…,xm,y1,…,ys)∈PPS} for all i=1,…,m and r=1,…,s, then (XI,YI)=(x1I,…,xmI,y1I,…,ysI) is an ideal point. Usually the ideal point is not in the PPS.


## 3. Finding a Preferred Efficient DMU Using the Gradient Projection of the Utility Function

In this section, we would like to find a target of DMUs in the PPS which has the best utility function value when the utility function of the DM’s preferences is available. This target is called the most preferred DMU. In this regard, we assume thatu(X,Y) is the utility function of the DM’s preferences. In the remaining of this paper, we use the lower index for an observed DMU such as DMUj and the upper index for a virtual DMU which, possibly, is unobserved such as DMUk. DMUk with activity vector (Xk,Yk) clarifies the generated DMU in the kth iteration of the algorithm.LetDMUk-1 be an efficient DMU in the PPS. To move to another efficient DMU in the PPS which is shown by DMUk we use the following linear programming problem:(5)max⁡∑i=1mδiqi+∑r=1sγrprs.t.Xk,Yk,Q,P∈Λ,where (Xk,Yk,Q,P)=(x1k,…,xmk,y1k,…,ysk,q1,…,qm,p1, …,ps) and(6)Λ=Xk,Yk,Q,P∣xik≤xik-1+Δxik-1-qi,yrk≥yrk-1-Δyrk-1+pr,qi≥0,pr≥0,Xk,Yk∈PPS,i=1,…,m,r=1,…,s.In the above model at first the DMU throws in the PPS by decreasingΔY from outputs and adding ΔX to the inputs of DMUk-1. Then, it arises on the efficient frontier by adding P to outputs and subtracting Q from inputs. In problem (5), Δyrk-1, Δxik-1, γr, and δi are nonnegative constants and pr and qi are the auxiliary variables for all i=1,2,…,m and r=1,2,…,s.To reach a DMU which has the better utility function value than the current efficient DMU, it is sufficient to project the gradient of the utility function on the efficient frontier at the current DMU, because the utility function value is increased at the ascent direction of the gradient projection.Remark 7.
To find a DMU which is better than(Xk-1,Yk-1) in the base of the utility function value, Δyrk-1, Δxik-1, γr, and δi should be determined at stage k-1. These scalars are determined based on the gradient of the utility function and its projection on the efficient frontier at (Xk-1,Yk-1).Theorem 8.
Suppose that(Xk∗,Yk∗,Q∗,P∗) is an optimal solution of (5).(1)
Ifδi>0 and γr>0, where i=1,2,…,m and r=1,2,…,s, then (Xk∗,Yk∗) is an efficient DMU in the PPS.(2)
Generally, if(δ,γ)=(δ1,…,δm,γ1,…,γs)≥0 and (δ,γ)≠0, then (Xk∗,Yk∗) is a weakly efficient DMU in the PPS.Proof.
Letδi>0 and γr>0 for all i=1,2,…,m and r=1,2,…,s. Moreover, consider (xik-1+Δxik-1,yrk-1-Δyrk-1)∈PPS, so problem (5) is rewritten as follows:(7)max⁡∑i=1mδiqi+∑r=1sγrprs.txik≤xik-1+Δxik-1-qi,i=1,2,…,m,yrk≥yrk-1-Δyrk-1+pr,r=1,2,…,s,xik≥∑j=1nλjxij,i=1,2,…,m,yrk≤∑j=1nλjyrj,r=1,2,…,s,pr≥0,r=1,2,…,s,qi≥0,i=1,2,…,m,where xik, yrk, qi, and pr, i=1,2,…,m and r=1,2,…,s, are variables. Let (Xk∗,Yk∗,Q∗,P∗) be the optimal solution of problem (7). So we have(8)xik∗=xik-1+Δxik-1-qi∗,i=1,2,…,m,yrk∗=yrk-1-Δyrk-1+pr∗,r=1,2,…,s.
By contradictions, suppose that(Xk∗,Yk∗) is not an efficient DMU and another DMU such as (X¯,Y¯) is an efficient DMU in the PPS which dominates (Xk∗,Yk∗). Therefore, X¯≤Xk∗,Y¯≥Yk∗ and at least one inequality is strict. This implies that there exist vectors T=(t1,t2,…,tm)∈R+m and N=(n1,n2,…,ns)∈R+s such that X¯+T=Xk∗, Y¯-N=Yk∗, and (T,N)≠0. So from (8) we have (9)xi¯+ti=xik-1+Δxik-1-qi∗,i=1,2,…,m,yr¯-nr=yrk-1-Δyrk-1+pr∗,r=1,2,…,s,T,N≥0,T,N≠0.Let yr~=yr¯, xi~=xi¯, pr~=pr∗+nr, and qi~=qi∗+ti for i=1,2,…,m and r=1,2,…,s. Therefore, (X~,Y~,Q~,P~) is a feasible solution for problem (7) such that (Q~,P~)≥(Q∗,P∗) and (Q~,P~)≠(Q∗,P∗). Because of γr>0 and δi>0 for all i and r, the objective function’s value of problem (7) corresponding to this feasible solution, (X~,Y~,Q~,P~), is larger than the optimal value of (7) and this contradicts with our assumption that (Xk∗,Yk∗,Q∗,P∗) is an optimal solution of (5) and (7).
The proof of property  2 is similar to the proof of property  1.Theorem 9.
Let(Xk,Yk)∈SE and (XI,YI) be the ideal point. Suppose that wr=1/yrI-yrk(r=1,2,…,s) and zi=1/xik-xiI(i=1,2,…,m). If yrI-yrk>0 and xik-xiI>0 for all i and r, then (Xk,Yk) is an optimal solution of the following problem:(10)minX,Y∈PPS⁡max⁡r,iwryrI-yr,zixi-xiI.Proof.
Problem (10) is equivalent to the following problem:(11)min⁡θs.t.wryrI-yr≤θ,r=1,2,…,s,zixi-xiI≤θ,i=1,2,…,m,X,Y∈PPS,θ≥0,where xi,yr, and θ, i=1,2,…,m and r=1,2,…,s, are variables.
By contradiction, suppose that(Xk,Yk) is not an optimal solution of this problem. Therefore, there exists (X¯,Y¯) such that (X¯,Y¯) is an optimal solution of (11) and θ¯ is the optimal value of that. We have θ¯<1 because (Xk,Yk,θk), where θk=1, is a feasible solution of problem (11). Moreover, wr(yrI-yr¯)≤θ¯<θk=1 and then wr(yrI-yr¯)<1. By the assumption of wr>0 and the definition of the ideal point, we haveAyrk<yr¯,r=1,2,…,s.Similarly, zi(xi¯-xiI)≤θ¯<θk=1 and we can conclude thatBxik>xi¯,i=1,2,…,m.A and B imply that (Xk,Yk) is dominated by (X¯,Y¯) and this contradicts with the assumption that (Xk,Yk) is efficient. Therefore, (Xk,Yk) is the optimal solution of problems (10) and (11).Suppose thatNk is a unique normal vector of the PPS at (Xk,Yk). Because the PPS is a polyhedron, Nk is the normal vector of a defining hyperplane of the PPS at (Xk,Yk). Using Nk, we can find the projection of the gradient of the utility function on the efficient frontier at this point. In other words, if ∇u(Xk,Yk) is not orthogonal to any tangent plane (defining hyperplane) of the PPS at (Xk,Yk), then we can project ∇u(Xk,Yk) on the tangent plane of the PPS at this point. This projection provides a direction at (Xk,Yk) in which the utility function value can be increased.Remark 10.
To obtain a defining hyperplane of the PPS at an efficient DMU, it is sufficient to solve problem (4) corresponding to the mentioned DMU. So if (U∗,V∗,u0∗), such that (U∗,V∗)>0, is an extreme optimal solution of (4), then U∗Y-V∗X+u0∗=0 is a defining hyperplane of the PPS and (U∗,-V∗) is the normal vector of this hyperplane (see Jahanshahloo et al. [23]).Theorem 11.
Let(Xk,Yk)∈SE and the gradient of the utility function at (Xk,Yk) is given by ∇u(Xk,Yk)=(∂u(Xk,Yk)/∂x1,…,∂u(Xk,Yk)/∂xm,∂u(Xk,Yk)/∂y1,…, ∂u(Xk,Yk)/∂ys). If (Xk,Yk) is a member of the PPS which has the best utility function value, then there exists a supporting hyperplane of the PPS at (Xk,Yk) whose normal vector is parallel to the gradient vector of the utility function at (Xk,Yk); that is,(12)∇uXk,Yk=cNk,where Nk is the normal vector of a supporting hyperplane on the PPS at (Xk,Yk) and c is a positive scalar number.Proof.
When(Xk,Yk) has the best utility function value, we can conclude that there does not exist any ascent direction of u on the efficient frontier at (Xk,Yk) such that we can move from (Xk,Yk) on the efficient frontier and the value of u is increased. Because of the convexity of the PPS, we have ∇uXk,Yk·(X-Xk,Y-Yk)≤0; that is, ∇u(Xk,Yk)·(X,Y)≤∇u(Xk,Yk)·(Xk,Yk) for all (X,Y)∈PPS. This implies that H={(X,Y)∈Rm+s∣∇u(Xk,Yk)·(X,Y)=t} is a supporting hyperplane of the PPS binding at (Xk,Yk) where t=∇u(Xk,Yk)·(Xk,Yk).Result. Let N1,…,Nv be the normal vectors of the defining hyperplanes of the PPS binding at (Xk,Yk). If ∇u(Xk,Yk)∈Pos{N1,…,Nv}, then (Xk,Yk) is a most preferred DMU, where Pos{N1,…,Nv}={N∣N=∑j=1v‍αjNj,αj≥0,j=1,2,…,v}.Remark 12.
If(Xk,Yk) is a relative interior point of a facet of the PPS, then the normal vector of the PPS at (Xk,Yk) is unique.Condition (12) shows that if (Xk,Yk) is an efficient DMU with the best utility function value, then the projection of the gradient of u at (Xk,Yk) on the efficient frontier is zero. This shows that there does not exist any ascent direction of u at (Xk,Yk) and so (Xk,Yk) is the most preferred DMU. Otherwise, if (Xk,Yk) is not a most preferred DMU, then we project the gradient of u on the efficient frontier. This projection shows the ascent direction of u at (Xk,Yk). In this regard, suppose that Nk is the unique normal vector of the PPS at (Xk,Yk) and θ is the angle between ∇u(Xk,Yk) and Nk. If θ>0, then the tangent plane of the PPS, which is orthogonal to Nk, is not parallel to a plane which is orthogonal to ∇u(Xk,Yk). So we can proceed from (Xk,Yk) at the ascent direction of u. Otherwise, if θ=0, then the most preferred DMU has been obtained.Remark 13.
If(Xk,Yk) is an efficient DMU and there exist more than one defining hyperplane binding at this DMU, then we have multiple normal vectors of the PPS at (Xk,Yk). In this case, we choose one of the normal vectors which has the minimum angle with ∇u(Xk,Yk); after that, ∇u(Xk,Yk) is projected on the defining hyperplane corresponding to the chosen normal vector.Theorem 14.
Suppose that(Xk,Yk) is an efficient DMU and ∇u(Xk,Yk) is the gradient of u at this DMU. If d(Xk,Yk)≠0, denoted as follows, is the projection of ∇u(Xk,Yk) on the defining hyperplane of the PPS binding at this point, then d(Xk,Yk) is the ascent direction of u at (Xk,Yk). Furthermore,(13)dXk,Yk=∇uXk,Yk-∇uXk,YkNkNkNkNk,where Nk is the normal vector of the defining hyperplane of the PPS binding at (Xk,Yk).Proof.
Geometrically, (13) is clear. If relation (13) is multiplied by ∇u(Xk,Yk), then we have (14)∇uXk,Yk·dXk,Yk=∇uXk,Yk21-cos2⁡θ=∇uXk,Yk2sin2⁡θ,where θ is the angle between ∇u(Xk,Yk) and Nk. Regarding θ≠0, we conclude that ∇u(Xk,Yk)·d(Xk,Yk)>0, because the right hand side of the above equation is positive. Therefore, d(Xk,Yk) is the ascent direction of u at (Xk,Yk).Corollary 15.
If(Xk,Yk) is an efficient DMU and it has the best utility function value, then there exists a normal vector corresponding to a supporting hyperplane of the PPS at this DMU such that d(Xk,Yk)=0.Proof.
Because(Xk,Yk) has the best utility function among all DMUs in the PPS, regarding Theorem 11, there exist c>0 and a supporting hyperplane of the PPS at (Xk,Yk) with normal vector Nk such that ∇u(Xk,Yk)=cNk. Therefore, by relation (13) we have (15)dXk,Yk=cNk-cNkNkNkNkNk=0.Corollary 16.
Suppose that(Xk,Yk) is an efficient DMU and it has the best utility function value. Moreover, let the normal vector of the PPS at this point be Nk=(U∗,-V∗) such that U∗>0 and V∗>0; then one has (16)∂uXk,Yk/∂y1u1∗=⋯=∂uXk,Yk/∂ysus∗=-∂uXk,Yk/∂x1v1∗=⋯=-∂uXk,Yk/∂xmvm∗=c.The proof of Corollary16 can be obtained directly by Theorem 11. Note that Nk=(U∗,-V∗) can be obtained easily using Theorem 4 by solving problem (4).


## 4. Finding the Most Preferred DMU in DEA: An Algorithm

Let the gradient of the utility function at(Xk-1,Yk-1) be (17)∇uXk-1,Yk-1=∂uXk-1,Yk-1∂x1,…,∂uXk-1,Yk-1∂xm,∂uXk-1,Yk-1∂y1,…,∂uXk-1,Yk-1∂ys.Consider an arbitrary index l∈{1,2,…,s} as the index of a reference output such that w=∂u(Xk-1,Yk-1)/∂yl>0, where w=max⁡{∂u(Xk-1,Yk-1)/∂yr∣r=1,2,…,s}. Let the normalized gradient vector of the utility function at (Xk-1,Yk-1) be Gk-1 which is identified as follows:(18)Gk-1=∇uXk-1,Yk-1w.The projection of Gk-1 on the efficient frontier at (Xk-1,Yk-1) is shown by d(Xk-1,Yk-1) and it is determined as follows:(19)dXk-1,Yk-1=Gk-1-Gk-1Nk-1Nk-1Nk-1Nk-1.Let d(Xk-1,Yk-1)=(dx1k-1,…,dxmk-1,dy1k-1,…,dysk-1), and(20)Ωk=X,Y,Q,P∣xi≤xik-1+Δxik-1-qi,yr≥yrk-1-Δyrk-1+pr,qi≥0,pr≥0,X,Y∈PPS,i=1,…,m,r=1,…,s,where(21)Δxik-1=α¯k-12dxik-1+dxik-1,i=1,2,…,m,Δyrk-1=α¯k-12dyrk-1-dyrk-1,r=1,2,…,s,(22)α¯k-1=α2·αk-1.In (22), α∈[0,1] is a scalar and αk-1 is the largest step size to move from (Xk-1,Yk-1) in direction d(Xk-1,Yk-1) to remain in the PPS. In other words, αk-1=max⁡{α∣(Xk-1,Yk-1)+αd(Xk-1,Yk-1)∈PPS}. αk-1 is obtained by solving the following linear programming problem:(23)αk-1=max⁡αs.t.∑j=1nλjXj≤xik-1+αdxik-1,i=1,2,…,m,∑j=1nλjYj≥yrk-1+αdyrk-1,r=1,2,…,s,∑j=1nλj=1,λj≥0,j=1,2,…,n,α≥0.To find a preferred solution comparing to (Xk-1,Yk-1), we solve the following linear programming model:(24)max⁡∑i=1mδiqi+∑r=1sγrprs.t.Xk,Yk,Q,P∈Ωk,where the components of (Xk,Yk,Q,P)=(x1k,…,xmk,y1k,…,ysk,q1,…,qm,p1,…,ps) are the variables. Moreover, δi and γr, i=1,2,…,m and r=1,2,…,s, are the constants.By the above discussions the summary of the proposed algorithm to find the most preferred DMU in DEA is presented as follows.Step 1.
Letk≔1 and find an initial efficient DMU (X1,Y1). To find this point (DMU) we can solve one of DEA models such as problem (2) for evaluating an observed DMU to project it on the efficient frontier. The projected DMU can be used as an initial efficient DMU. Note that if the evaluated observed DMU is on the efficient frontier, then it can be used as an initial efficient DMU.Step 2.
Letk≔k+1. Find the normal vector (Nk-1) of the PPS at (Xk-1,Yk-1) by solving problem (4). Consider yl(l∈{1,2,…,s}) as the reference output. Identify Gk-1 at (Xk-1,Yk-1) by (18).Step 3.
Findd(Xk-1,Yk-1) using (19). If d(Xk-1,Yk-1)=0, then the most preferred DMU is (Xk-1,Yk-1) and stop. Otherwise, if d(Xk-1,Yk-1)≠0, then go to Step 4.Step 4.
Find the step sizeαk-1 by solving problem (23). Moreover, let α2≔1.Step 5.
Letα¯k-1≔α2αk-1, and define Ωk by (20) and (21). Furthermore, solve problem (24) to obtain (Xk,Yk). If (Xk,Yk)=(Xk-1,Yk-1), then (Xk,Yk) is the most preferred DMU and stop; otherwise, go to Step 6.Step 6.
FindNk and then d(Xk,Yk). If d(Xk,Yk)=0, then (Xk,Yk) is the most preferred DMU and stop. If dXk,Yk·d(Xk-1,Yk-1)<0, then let α2≔α2/2 and go to Step 5. Otherwise, if d(Xk,Yk)·d(Xk-1,Yk-1)>0, then let k≔k+1 and go to Step 4.


## 5. Conclusion

In data envelopment analysis, usually, the projection of an inefficient DMU on the efficient frontier of the production possibility set is used as a target of the DMU. This target has two characteristics: the under-assessment inefficient DMU is dominated by its target and the target is efficient. The target is obtained corresponding to the used models. In other words, the targets, usually, are different depending on using different DEA models and the amounts of inputs and outputs of the observed DMUs. Moreover, possibly, the decision-maker has some preferences to characterize the target. In this case the standard DEA models cannot find a target of a DMU which maximizes the decision-maker’s preferences. In this paper, we propose an approach to find a target of DMUs which maximizes the utility function value of the decision-maker’s preferences. This approach is constructed based on finding the defining hyperplanes of the production possibility set and the projection of the gradient vector of the utility function on the defining hyperplanes of the production possibility set. By this projection, an ascent direction of the utility function is obtained and another DMU which has the better value of the utility function is obtained. By an iterative algorithm, the most preferred DMU is obtained.



---

*Source: 7171467-2016-12-08.xml*