# Centralized Resource Allocation and Target Setting Based on Data Envelopment Analysis Model

Authors: Tiantan Yang; Pingchun Wang; Feng Li
Journal: Mathematical Problems in Engineering
 (2018)

---

## Abstract

This paper aims to develop a data envelopment analysis (DEA) based model for allocating input resources and deciding output targets in organizations with a centralized decision-making environment, for example, banks, police stations, and supermarket chains. The central decision-maker has an interest in maximizing the total output production and at the same time minimizing the total input consumption. Traditionally, all decision-making units (DMUs) can be easily projected to the efficient frontier, which is a mathematical feasibility; however, it does not guarantee the managerial feasibility during the planning period. In this paper, we will take potential limitations of input-output changes into account by building a difficulty coefficient matrix of modifying their production in the current production possibility set so that the solution guarantees managerial feasibilities. Three objectives, namely, maximizing aggregated outputs, minimizing the consumption of input resources, and minimizing the total difficulty coefficient, are proposed and incorporated into the formation of resource allocation and target setting scheme. Building on this, we combine DEA and multiobjective programming to solve the resource allocation and target setting problem. In the end, we apply our proposed approach to a real-world problem of sixteen chain hotels to illustrate the efficacy and usefulness of the proposed approach.


---

## Body

## 1. Introduction

In many real scenarios, there are many complex organizations typically consisting of a number of individual production units, such as an education authority that may correspond to different schools. In such organizational environment, all the decision-making units (DMUs) fall under the umbrella of a central unit which has power to oversee them. Management of these large companies and public service organizations needs coordinating mechanism to better manage its resources to fulfill its mission. How to allocate resource and set targets is an important thing for the central unit. In this research we deal with the problem of allocating input resources and setting output targets which happen on the organizational level. The organization will have to set targets for each unit which should be logically linked to the resource that organization allocates to each unit simultaneously.Resource allocation and/or target setting is a typical problem in organizations, which has become one of hottest topics and classical applications in economic and managerial field. Data envelopment analysis (DEA) has proved to be a powerful tool for determining the relative efficiencies of the decision-making units, which consume multiple inputs to produce multiple outputs. Since DEA was first introduced by Charnes et al. [1], it has been prevalent to deal with complex problems and cases in the public or private organization. Although the original object of this method is on the efficiency measurement, it has been applied to various activities [2–4]. Additionally, it has recently been developed for resource allocation and target setting. Cook and Kress [5] made the first attempt to allocate a total fixed cost among a set of DMUs based on two principles of efficiency invariance and Pareto optimality. Jahanshahloo et al. [6, 7] showed that the principles used in Cook and Kress [5] might be violated. Beasley [8] used the concept of cross-efficiency to maximize the average efficiency score of all DMUs for allocating fixed costs under a set of common weights. Subsequently, Fang and Zhang [9] formulated a bicriteria DEA-based resource allocation model. The first objective was to maximize the average DMU efficiency (the total efficiency at the organization level) as same as the model of Beasley [8]. The second objective represented the minimal quantity among all the efficiency variables (equity among the individual unit’s efficiency). Lin and Chen [10] allocated a fixed input based on super-CCR efficiency and efficiency invariance principle. Yu et al. [11] allocated a fixed cost using two-stage network data envelopment approach. Li et al. [12] proposed a game-DEA cross-efficiency approach for allocating a fixed cost. Golany [13] used a multiobjective programming to determine output goals based on DEA models. Athanassopoulos [14] has presented a Go-DEA model for dealing with the conflicting objection of efficiency, effectiveness, and quality in resource allocation. Furthermore, Athanassopoulos [15] proposed a TARBA model based on a similar framework to that of Go-DEA, which will be solved in two steps. First, the optimal weights of each DMU are determined using a multiplier DEA model. Then the optimal weights are used to define feasible trade-offs in resource allocation. Matin and Azizi [16] addressed the target setting problem with negative data. Dehnokhalaji et al. [17] addressed the resource allocation problem by keeping the cost efficiencies improved or unchanged. In that paper, two strategies are considered, namely, keeping the cost efficiencies of all DMUs unchanged by fixing the technical and allocative efficiencies and improving the cost efficiencies of DMUs after the allocation as much as possible.Normally, the output target is set simultaneously by allocating some input resources. Amirteimoori and Kordrostami [18] proposed a resource allocation and target setting model by combining the efficiency invariance principle of Cook and Kress [5] and the common weight of Beasley [8]. Amirteimoori and Tabar [19] proposed a DEA model which simultaneously allocates fixed resource and sets output targets. In their paper, the authors introduced goals achievement variables for the efficiency level, allocated resources, and set targets to obtain a unique allocation plan. By considering the internal structure, Bi et al. [20] addressed the problem of resource allocation and target setting for a parallel production system. Lin [21] proposed a method for allocating input resources and setting output targets in such a way that the efficiency invariance principle was satisfied. Lotfi et al. [22] and Hatami-Marbini et al. [23] combined goal programming method with a set of common weights to address the resource allocation and target setting problem. Further, the postallocation efficiency scores were maximized. Recently, Li et al. [24] proposed a new DEA-based approach for resource allocation and target setting based on common weights and efficiency invariance. Their approach allows the trade-off between common weights and efficiency invariance principles, and the final allocation and target scheme is determined by minimizing the distance of two possible plans.In many real managerial applications, there are situations where all DMUs are controlled by a centralized decision-maker. Under the circumstances, the centralized decision-maker would like to increase the overall output production and decrease the total input resource consumption. Lozano and Villa [25] set up the centralized data envelopment analysis models to minimize the overall resource consumption or to maximize the total output production in an organization, rather than considering each DMU separately. They formulated two models for such resource allocation problem. One type of models seeks radial reductions of the total consumption of every input while the other model seeks separate reductions for each input. Lozano and Villa [26] extended the work of Lozano and Villa [25] to more general multiple-input-multiple-output centralized cases with both radial and nonradial models. Lozano et al. [27] also used the centralized approach to analyze the performance of a number of Spanish municipalities in terms of the amount of glass recycled and counted an optimal allocation of collecting boxes for maximizing the recycling of glass waste; in addition, they also have taken integer variables into account while using the centralized way. Moreover, Asmild et al. [28] extended and modified the model of Lozano et al. [27], proposing the centralized resource allocation and target setting model which only considers adjustments of the previous inefficiency units. Korhonen and Syrjänen [29] developed an interactive formal approach based on DEA and multiple objective linear programming in organizations with a centralized decision-making environment and applied it to solve a resource allocation problem in order to maximize the total production under the assumption that the units can modify their current production possibility set. Pachkova [30] studied a restricted resource reallocation problem, where the restriction is formulated as the maximum cost the managers are willing to pay. Further, the author made a trade-off between the highest efficiency the aggregated unit can achieve and the maximum allowed reallocation cost. Lozano et al. [31] reallocated the emission permits using three lexicographical objectives, namely, maximizing aggregated desirable production, minimizing undesirable total emissions, and minimizing the consumption of input resources. Given a capital budget constraint, Lozano et al. [32] proposed a series of centralized DEA models for individual and collective output target setting, input reallocation, and additional input acquisitions. Lozano [33] proposed a slack-based measure model for fixed cost and common revenue allocation under a centralized environment. Fang [34] proposed a new centralized approach for resource allocation based on efficiency analysis, in which a sequence of intermediate benchmark targets was determined as well as a level-wise improvement path, which can improve the DMUs to their ultimate targets on the efficient frontier in an implementable and realistic manner. Fang [35] proposed a centralized resource allocation approach based on revenue efficiency, and the allocation plan was determined by maximizing the total output revenue.Traditionally, the DEA literature thinks that the unit is able to reach any point on the efficient frontier easily, which is a mathematical feasibility; however, it does not guarantee managerial feasibility during the planning period. Moreover, it projects on the efficiency frontier, which declares that the DMU has the potential to achieve the input reducing and output increasing, which provide a direction of each DMU’s improvement. If the center decision-maker does not consider the effect of the restricted input reducing and output increasing, he will make incorrect decisions. In this text we will consider the potential restrictions of the change in the unit’s production during the planning period when the center decision-maker faces the resource allocation and target setting problem. To this end, we build a difficulty coefficient matrix of modifying the current production so that the solution guarantees managerial feasibilities. Further, three objectives are used to generate the final resource allocation and target setting plan, namely, maximizing aggregated output, minimizing the consumption of input resources, and minimizing the total difficulty coefficient. The DEA methodology and multiobjective programming are combined to solve the problem.The remainder of this paper is organized as follows: in Section2, we revisit the preliminary work in DEA literature. Then in Section 3, we propose the new resource allocation and target setting approach. An empirical application was applied to illustrate the proposed approach in Section 4. Finally, we conclude this paper in Section 5.


## 2. Preliminary Consideration

At the starting point, we assume there existn DMUs, with each DMU consuming m inputs and producing s output. Now we denote Xj=x1j,…,xmj and Yj=y1j,…,ysj as the vector of inputs and outputs of DMUjj=1,…,n, respectively, where xij and yrj are the observed levels of the ith input and rth output of DMUj. The basic DEA model, called CCR model, which is based on the constant returns to scale for assessing the relative efficiency of a given DMU0 has been proposed by Charnes et al. [1]. The basic model is presented as(1)e0∗=max∑r=1sμryr0∑i=1mυixi0s.t.∑r=1sμryrj∑i=1mυixij≤1,j=1,…,nμr,υi≥ε,r=1,…,s,i=1,…,m.In the above model,μrr=1,…,s and υii=1,…,m are unknown relative weights attached to the rth output and ith input, respectively. ε presents a positive non-Archimedean infinitesimal number. It is clear that model (1) is a nonlinear model which is also called the multiplier model. We can easily transform model (1) to a liner equivalent as shown in the following model: (2)e0∗=max∑r=1suryr0s.t.∑r=1suryrj-∑i=1mvixij≤0,j=1,…,n∑i=1mvixi0=1ur,vi≥ε,r=1,…,s,i=1,…,m.Model (2) is an input-oriented model, which can be easily solved to calculate the optimal efficiency. DMU0 is defined as efficient if there exists at least one optimal ur∗,∀r;vi∗,∀i of model (2) and ∑r=1sur∗yr0=1 with ur∗≥ε and vi∗≥ε. Otherwise DMU0 is inefficient.Its dual problem is also useful in realistic applications, which is expressed as follows:(3)θ0∗=maxθs.t.∑j=1nλjxij≤θxio,i=1,…,m∑j=1nλjyrj≥yro,r=1,…,sλj≥0,j=1,…,n.The optimal objective function of model (3) ranges between zero and one. If the model receives a score of one, then DMU0 is defined as DEA efficient and DEA inefficient otherwise.


## 3. DEA-Based Resource Allocation and Target Setting Model

Traditional resource allocation and target setting model based on DEA methodology considers one unit at a time in relation to the other units. We can discover that a great deal of DEA models take the organizational setting into account. Cook et al. [36] framed an efficiency analysis model for a hierarchical condition where the measured units operate under the umbrella of different groups. The groups are assumed to have the power to control a part of the resources, which affects the possibilities of the assessed efficiency of the individual units. Now we will also use the DEA model to take the organizational setting into account, where the setting is similar to the above-mentioned paper that considers resource allocation and target setting problem. However, previous papers assume that the unit can reach any point on the efficiency frontier. Because of the managerial, political, and environmental limitations and so on the unit modifies its current position in the planning period to project the efficiency frontier, which is a mathematical feasibility instead of a managerial feasibility. If the central decision-maker does not emphasize the importance to consider the limitations of change in the unit’s production during the planning period, he will make erroneous decisions. Like this, it will cause the unreasonableness of resource allocation and bring an excessive target which the unit cannot achieve. Moreover, it loses incentive function by allocating resource and target setting.In this side, our approach clearly deviates from earlier papers which use the DEA model to solve the resource allocation and target setting problem. We will take the potential limitations of changing the unit’s production into account to guarantee managerial feasibility by projecting onto efficiency frontier during the planning period. In general, there are a lot of influence factors which restrict the change and thus subtract a proportion of the potential output. There is no doubt that we could set a “price” for the change. But there are factors which cannot use the price to measure the restriction of change, such as management efforts. We will use the difficulty coefficient to weigh the limitations of reaching the efficiency frontier. During the planning period, the central decision-maker will set the difficulty coefficient of reducing centesimal input and increasing centesimal output based on the managerial experience, the limit of budget, and manager’s preference. The central decider could use the analytic hierarchy process (AHP) and group decision to set the difficulty coefficient matrix. With larger value of the difficulty coefficient, it is more difficult to change the current situation of the production in the next prior.In this section, we will propose three objectives, namely, maximizing aggregated output, minimizing the consumption of input resources, and minimizing the total difficulty coefficient, and create a model with these objectives for producing a resource allocation and target setting scheme.


### 3.1. Notation and Objection Functions

Before formulating the models, the required notation needs to be introduced. Here we summarize these mathematical notations as follows.Parameters
n: the number of DMUs
k
,
j
=
1
,
…
,
n: index for DMUs
m: the number of inputs
i
=
1,2
,
…
,
m: index for inputs
s: the number of outputs
r
=
1,2
,
…
,
s: index for outputs
x
i
j: the value of input i consumed by DMU j
y
r
j: the value of output r produced by DMU j
c
1
,
c
2
,
…
,
c
m: the difficulty coefficient vector of input reducing by projecting on the efficiency frontier
d
1
,
d
2
,
…
,
d
s: the difficulty coefficient vector of output increasing by projecting on the efficiency frontierVariables
λ
1
j
,
λ
2
j
,
…
,
λ
n
j: vector of variables of linear combination coefficients for DMU j
x
-
i
j: an unknown amount of input i allocated to DMU j
y
-
r
j: an unknown amount of output r targeted for DMU jAccording to the efficiency objective, it seeks to achieve “more-for-less”; in other words, if the resources are allocated, the amount of the total outputs of the DMUs should be maximized, or the target plan of output produced is given; the resources of all the DMUs consumed will be minimized. Also we will emphasize that it is very important to take potential limitations of the change during the planning time into account.To illustrate resource allocation and target setting, we will consider the situations based on the following general constraints.(1)
The targeted outputs shall not decrease for any of the DMUs while the unit is able to reach any point on the efficient frontier. This idea is modelled as(4)y-rj≥yrj,r=1,…,s;j=1,…,n.(2)
The allocated inputs shall not increase for any of the DMUs while the unit is able to reach any point on the efficient frontier. Similarly, we have(5)x-ij≤xij,i=1,…,m;j=1,…,n.The multiobjectives we impose are as follows.(1)
Maximizing the total output of the all DMUs:(6)O1≡max1s∑r=1s∑j=1ny-rj∑j=1nyrj.(2)
Minimizing the total input of the all DMUs:(7)O2≡min1m∑i=1m∑j=1nx-ij∑j=1nxij.(3)
Minimizing the total difficulty coefficient of the all DMUs:(8)O3≡min1n∑j=1n∑i=1mcixij-x-ijxij+∑r=1sdry-rj-yrjyrj.Thus, the first objective function is to maximize the average percentage increase in the total outputs when the resource variable of each DMU is given. The second objective function is to minimize the average percentage decrease in the total inputs when the target of each unit is set. The third objective function is to minimize the total difficulty coefficient; in other words, it is to minimize the cost of change of the current production in the next period. Also it is to engage the managerial feasibility and coincidence of the company’s actual production. Traditionally, we maximize the total outputs and minimize the total inputs as the objective function. However, when the inputs or the outputs are more than one, the problem is a multiple-criteria problem. Now we choose the proportion form which has an interesting feature of the three objective functions which is invariance to the unit measurement. If any input variable or output variable changes its units of assessment, the objective function values do not change for any feasible solution. Because of the dimensionless quality of the ratios that are summed in each of the expressions, the optimal solutions of the proposed models will not change with changes in the units of assessment.


### 3.2. Resource Allocation and Target Setting Model

Based on the given some objective functions and some general constraints, we form a multiple objective model for allocating resource and setting target for each DMU. Letαii=1,…,m be the reduction factor of the total input i,  βrr=1,…,s the increase factor of the total output r, and tjj=1,…,n the difficulty coefficient of changing the current production for DMUj. The multiple objective function is formed as follows:(9)max⁡1s∑r=1sβr,min⁡1m∑i=1mαi,min⁡1n∑j=1ntjs.t.∑j=1nx-ij=αi∑j=1nxij,i=1,…,m∑j=1ny-rj=βr∑j=1nyrj,r=1,…,s∑k=1nλkjxik≤x-ij,i=1,…,m;j=1,…,n∑k=1nλkjyrk≥y-rj,r=1,…,s;j=1,…,nx-ij≤xij,i=1,…,m;j=1,…,ny-rj≥yrj,r=1,…,s;j=1,…,ntj=∑i=1mcixij-x-ijxij+∑r=1sdry-rj-yrjyrj,j=1,…,nx-ij,y-rj,λkj≥0,i=1,…,m;r=1,…,s;k,j=1,…,n.Model (9) is a multiple objective linear programming. The purpose of the model is to find a feasible linear combination of the input and output vectors of each DMU that simultaneously maximizes all the outputs and minimizes all the inputs under considering potential limitations of the change in the current production during the next period. The problem, like the other multiple-criteria models, has no unique solution in general. Theoretically, any one dominant solution is reasonable in the multiple-criteria decision-making (MCDM) literature.As to the multiple objective linear programming of model (9), we can use any MOLP technique (for more information, see, e.g., [37]) to solve the multiple objective optimization problem. A possible and currently popular way is to search for solutions of the MOLP problem on the efficient frontier. Using the production possibility set as the set of feasible operation points of each DMU, we can project any given points on the efficient frontier in the objective space. So we will use this method to search the most preferred solution under considering the potential limitations of projecting on the efficient frontier. Because of those limitations, some DMU cannot reach any point on the efficient frontier during the planning period. We must make trade-off between the maximum outputs or the minimal inputs with the total difficulty coefficient, considering the decision-maker can adjust the total difficulty coefficient based on the company’s strategy. If the company’s strategy is short term, he may accept a smaller difficulty coefficient. He does not want to change the current production conditions during the next term. Especially in the short run, changing the production of projecting on the efficient frontier can be very expensive. There may be labor contracts, buildings, and so on. which make it impossible to move production. So the decision-makers allocate resource and set target for each DMU considering their abilities in the actual production environment. If the company’s strategy is long term, he may accept a larger difficulty coefficient. He will make the appropriate investment to change the current production for projecting onto the efficient frontier as soon as possible. For example, he can introduce the advanced production technology to improve the efficiency. The larger the difficulty coefficient the company can receive, the more the outputs that can be acquired and the more the inputs that can be saved. In other words, the decision-maker is willing to spend a total cost on moving the current production onto efficiency frontier; he would have such an efficiency-gain which means achieving the maximum outputs and the minimal inputs.When we take the total difficulty coefficient of changing the production situation which the company can accept into account, we will first fix the level of DMU’s difficulty coefficient; then we will adjust the difficulty coefficient which the company can accept to observe the change of the total output increased or total input saved. The priorities of the total maximum output and the total minimal input can be done by the user. In this paper we will consider two alternations. In the first alternative, the priority is thatO1 is considered before O2; that is, firstly, the total production is maximized subject to total inputs limits; secondly, the total inputs are minimized subject to maintaining maximum total outputs. In the second alternative, the priorities are O2 before O1; that is, firstly, the total inputs are minimized subject to the total outputs limits; secondly, the total outputs are maximized subject to maintaining minimum total inputs. Also the total difficulty coefficient of changing the production situation which the company can accept is considered in the two alternatives.(1) Alternative 1Phase 1
(10)
m
a
x
1
s
∑
r
=
1
s
β
r
s
.
t
.
∑
j
=
1
n
y
-
r
j
=
β
r
∑
j
=
1
n
y
r
j
,
r
=
1
,
…
,
s
∑
k
=
1
n
λ
k
j
x
i
k
≤
x
-
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
∑
k
=
1
n
λ
k
j
y
r
k
≥
y
-
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
x
-
i
j
≤
x
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
y
-
r
j
≥
y
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
i
=
1
m
c
i
x
i
j
-
x
-
i
j
x
i
j
+
∑
r
=
1
s
d
r
y
-
r
j
-
y
r
j
y
r
j
≤
t
j
,
j
=
1
,
…
,
n
x
-
i
j
,
y
-
r
j
,
λ
k
j
≥
0
,
i
=
1
,
…
,
m
;
r
=
1
,
…
,
s
;
k
,
j
=
1
,
…
,
n
.Model (10) seeks to maximize the total output of the all DMU subject to the following: (1) no DMU loses outputs; (2) no DMU can increase its inputs; and (3) no DMU can exceed the difficulty coefficient which the company can accept.Letyrj∗ be the optimal value of the output targets of DMUjj=1,…,n in model (10) and βr∗ the corresponding increase factor for output r in the optimal solution of model (10). Note that the current situation represents a feasible solution in model (10) and it has an objective function solution equal to unity. Therefore, the optimal value will be greater than one (or at least equal to unity).Phase 2
(11)
m
i
n
1
m
∑
i
=
1
m
α
i
s
.
t
.
∑
j
=
1
n
x
-
i
j
=
α
i
∑
j
=
1
n
x
i
j
,
i
=
1
,
…
,
m
∑
k
=
1
n
λ
k
j
x
i
k
≤
x
-
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
∑
k
=
1
n
λ
k
j
y
r
k
≥
y
-
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
j
=
1
n
y
-
r
j
≥
β
r
∗
∑
j
=
1
n
y
-
r
j
,
r
=
1
,
…
,
s
x
-
i
j
≤
x
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
y
-
r
j
≥
y
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
i
=
1
m
c
i
x
i
j
-
x
-
i
j
x
i
j
+
∑
r
=
1
s
d
r
y
-
r
j
-
y
r
j
y
r
j
≤
t
j
,
j
=
1
,
…
,
n
0
≤
α
i
≤
1
,
i
=
1
,
…
,
m
x
-
i
j
,
y
-
r
j
,
λ
k
j
≥
0
,
i
=
1
,
…
,
m
;
r
=
1
,
…
,
s
;
k
,
j
=
1
,
…
,
n
.Model (11) wants to minimize the total input of the all DMU subject to the following: (1) no DMU loses outputs; (2) no DMU can increase its inputs; (3) the total output target is no less than that determined in phase 1; and also (4) no DMU can exceed the difficulty coefficient which the company can accept.(2) Alternative 2Phase 1
(12)
m
i
n
1
m
∑
i
=
1
m
α
i
s
.
t
.
∑
j
=
1
n
x
-
i
j
=
α
i
∑
j
=
1
n
x
i
j
,
i
=
1
,
…
,
m
∑
k
=
1
n
λ
k
j
x
i
k
≤
x
-
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
∑
k
=
1
n
λ
k
j
y
r
k
≥
y
-
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
x
-
i
j
≤
x
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
y
-
r
j
≥
y
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
i
=
1
m
c
i
x
i
j
-
x
-
i
j
x
i
j
+
∑
r
=
1
s
d
r
y
-
r
j
-
y
r
j
y
r
j
≤
t
j
,
j
=
1
,
…
,
n
x
-
i
j
,
y
-
r
j
,
λ
k
j
≥
0
,
i
=
1
,
…
,
m
;
r
=
1
,
…
,
s
;
k
,
j
=
1
,
…
,
n
.Phase 2
(13)
m
a
x
1
s
∑
r
=
1
s
β
r
s
.
t
.
∑
j
=
1
n
y
-
r
j
=
β
r
∑
j
=
1
n
y
r
j
,
r
=
1
,
…
,
s
∑
k
=
1
n
λ
k
j
x
i
k
≤
x
-
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
∑
k
=
1
n
λ
k
j
y
r
k
≥
y
-
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
j
=
1
n
x
-
i
j
≤
α
i
∗
∑
j
=
1
n
x
i
j
,
i
=
1
,
…
,
m
x
-
i
j
≤
x
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
y
-
r
j
≥
y
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
i
=
1
m
c
i
x
i
j
-
x
-
i
j
x
i
j
+
∑
r
=
1
s
d
r
y
-
r
j
-
y
r
j
y
r
j
≤
t
j
,
j
=
1
,
…
,
n
x
-
i
j
,
y
-
r
j
,
λ
k
j
≥
0
,
i
=
1
,
…
,
m
;
r
=
1
,
…
,
s
;
k
,
j
=
1
,
…
,
n
,where αi∗ is the optimal value of the input decreased factor obtained in model (12).In addition to the proposed approach being the feature of unit invariant, obviously, an additional important feature is its flexibility. Thus, we can give a different relative weight which can be reflected in decision-maker’s subjective preference for different outputs, inputs, and difficulty coefficients. Assuming a weightwrr=1,…,s for output r to maximize them, it would only be needed to substitute the objective functions in model (9) to (13) by max⁡1/s∑r=1swrβr. Similarly, a different, relative weight δii=1,…,m can be given to input i to minimize them. So we will modify the objective functions in model (9) and (13) by min⁡1/m∑i=1mδiαi. Also a different, relative weight ξjξ=1,…,n can be given to DMU j to minimize them. So we will modify the objective functions in model (9) and (13) by min⁡1/n∑j=1nξjtj.


## 3.1. Notation and Objection Functions

Before formulating the models, the required notation needs to be introduced. Here we summarize these mathematical notations as follows.Parameters
n: the number of DMUs
k
,
j
=
1
,
…
,
n: index for DMUs
m: the number of inputs
i
=
1,2
,
…
,
m: index for inputs
s: the number of outputs
r
=
1,2
,
…
,
s: index for outputs
x
i
j: the value of input i consumed by DMU j
y
r
j: the value of output r produced by DMU j
c
1
,
c
2
,
…
,
c
m: the difficulty coefficient vector of input reducing by projecting on the efficiency frontier
d
1
,
d
2
,
…
,
d
s: the difficulty coefficient vector of output increasing by projecting on the efficiency frontierVariables
λ
1
j
,
λ
2
j
,
…
,
λ
n
j: vector of variables of linear combination coefficients for DMU j
x
-
i
j: an unknown amount of input i allocated to DMU j
y
-
r
j: an unknown amount of output r targeted for DMU jAccording to the efficiency objective, it seeks to achieve “more-for-less”; in other words, if the resources are allocated, the amount of the total outputs of the DMUs should be maximized, or the target plan of output produced is given; the resources of all the DMUs consumed will be minimized. Also we will emphasize that it is very important to take potential limitations of the change during the planning time into account.To illustrate resource allocation and target setting, we will consider the situations based on the following general constraints.(1)
The targeted outputs shall not decrease for any of the DMUs while the unit is able to reach any point on the efficient frontier. This idea is modelled as(4)y-rj≥yrj,r=1,…,s;j=1,…,n.(2)
The allocated inputs shall not increase for any of the DMUs while the unit is able to reach any point on the efficient frontier. Similarly, we have(5)x-ij≤xij,i=1,…,m;j=1,…,n.The multiobjectives we impose are as follows.(1)
Maximizing the total output of the all DMUs:(6)O1≡max1s∑r=1s∑j=1ny-rj∑j=1nyrj.(2)
Minimizing the total input of the all DMUs:(7)O2≡min1m∑i=1m∑j=1nx-ij∑j=1nxij.(3)
Minimizing the total difficulty coefficient of the all DMUs:(8)O3≡min1n∑j=1n∑i=1mcixij-x-ijxij+∑r=1sdry-rj-yrjyrj.Thus, the first objective function is to maximize the average percentage increase in the total outputs when the resource variable of each DMU is given. The second objective function is to minimize the average percentage decrease in the total inputs when the target of each unit is set. The third objective function is to minimize the total difficulty coefficient; in other words, it is to minimize the cost of change of the current production in the next period. Also it is to engage the managerial feasibility and coincidence of the company’s actual production. Traditionally, we maximize the total outputs and minimize the total inputs as the objective function. However, when the inputs or the outputs are more than one, the problem is a multiple-criteria problem. Now we choose the proportion form which has an interesting feature of the three objective functions which is invariance to the unit measurement. If any input variable or output variable changes its units of assessment, the objective function values do not change for any feasible solution. Because of the dimensionless quality of the ratios that are summed in each of the expressions, the optimal solutions of the proposed models will not change with changes in the units of assessment.


## 3.2. Resource Allocation and Target Setting Model

Based on the given some objective functions and some general constraints, we form a multiple objective model for allocating resource and setting target for each DMU. Letαii=1,…,m be the reduction factor of the total input i,  βrr=1,…,s the increase factor of the total output r, and tjj=1,…,n the difficulty coefficient of changing the current production for DMUj. The multiple objective function is formed as follows:(9)max⁡1s∑r=1sβr,min⁡1m∑i=1mαi,min⁡1n∑j=1ntjs.t.∑j=1nx-ij=αi∑j=1nxij,i=1,…,m∑j=1ny-rj=βr∑j=1nyrj,r=1,…,s∑k=1nλkjxik≤x-ij,i=1,…,m;j=1,…,n∑k=1nλkjyrk≥y-rj,r=1,…,s;j=1,…,nx-ij≤xij,i=1,…,m;j=1,…,ny-rj≥yrj,r=1,…,s;j=1,…,ntj=∑i=1mcixij-x-ijxij+∑r=1sdry-rj-yrjyrj,j=1,…,nx-ij,y-rj,λkj≥0,i=1,…,m;r=1,…,s;k,j=1,…,n.Model (9) is a multiple objective linear programming. The purpose of the model is to find a feasible linear combination of the input and output vectors of each DMU that simultaneously maximizes all the outputs and minimizes all the inputs under considering potential limitations of the change in the current production during the next period. The problem, like the other multiple-criteria models, has no unique solution in general. Theoretically, any one dominant solution is reasonable in the multiple-criteria decision-making (MCDM) literature.As to the multiple objective linear programming of model (9), we can use any MOLP technique (for more information, see, e.g., [37]) to solve the multiple objective optimization problem. A possible and currently popular way is to search for solutions of the MOLP problem on the efficient frontier. Using the production possibility set as the set of feasible operation points of each DMU, we can project any given points on the efficient frontier in the objective space. So we will use this method to search the most preferred solution under considering the potential limitations of projecting on the efficient frontier. Because of those limitations, some DMU cannot reach any point on the efficient frontier during the planning period. We must make trade-off between the maximum outputs or the minimal inputs with the total difficulty coefficient, considering the decision-maker can adjust the total difficulty coefficient based on the company’s strategy. If the company’s strategy is short term, he may accept a smaller difficulty coefficient. He does not want to change the current production conditions during the next term. Especially in the short run, changing the production of projecting on the efficient frontier can be very expensive. There may be labor contracts, buildings, and so on. which make it impossible to move production. So the decision-makers allocate resource and set target for each DMU considering their abilities in the actual production environment. If the company’s strategy is long term, he may accept a larger difficulty coefficient. He will make the appropriate investment to change the current production for projecting onto the efficient frontier as soon as possible. For example, he can introduce the advanced production technology to improve the efficiency. The larger the difficulty coefficient the company can receive, the more the outputs that can be acquired and the more the inputs that can be saved. In other words, the decision-maker is willing to spend a total cost on moving the current production onto efficiency frontier; he would have such an efficiency-gain which means achieving the maximum outputs and the minimal inputs.When we take the total difficulty coefficient of changing the production situation which the company can accept into account, we will first fix the level of DMU’s difficulty coefficient; then we will adjust the difficulty coefficient which the company can accept to observe the change of the total output increased or total input saved. The priorities of the total maximum output and the total minimal input can be done by the user. In this paper we will consider two alternations. In the first alternative, the priority is thatO1 is considered before O2; that is, firstly, the total production is maximized subject to total inputs limits; secondly, the total inputs are minimized subject to maintaining maximum total outputs. In the second alternative, the priorities are O2 before O1; that is, firstly, the total inputs are minimized subject to the total outputs limits; secondly, the total outputs are maximized subject to maintaining minimum total inputs. Also the total difficulty coefficient of changing the production situation which the company can accept is considered in the two alternatives.(1) Alternative 1Phase 1
(10)
m
a
x
1
s
∑
r
=
1
s
β
r
s
.
t
.
∑
j
=
1
n
y
-
r
j
=
β
r
∑
j
=
1
n
y
r
j
,
r
=
1
,
…
,
s
∑
k
=
1
n
λ
k
j
x
i
k
≤
x
-
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
∑
k
=
1
n
λ
k
j
y
r
k
≥
y
-
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
x
-
i
j
≤
x
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
y
-
r
j
≥
y
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
i
=
1
m
c
i
x
i
j
-
x
-
i
j
x
i
j
+
∑
r
=
1
s
d
r
y
-
r
j
-
y
r
j
y
r
j
≤
t
j
,
j
=
1
,
…
,
n
x
-
i
j
,
y
-
r
j
,
λ
k
j
≥
0
,
i
=
1
,
…
,
m
;
r
=
1
,
…
,
s
;
k
,
j
=
1
,
…
,
n
.Model (10) seeks to maximize the total output of the all DMU subject to the following: (1) no DMU loses outputs; (2) no DMU can increase its inputs; and (3) no DMU can exceed the difficulty coefficient which the company can accept.Letyrj∗ be the optimal value of the output targets of DMUjj=1,…,n in model (10) and βr∗ the corresponding increase factor for output r in the optimal solution of model (10). Note that the current situation represents a feasible solution in model (10) and it has an objective function solution equal to unity. Therefore, the optimal value will be greater than one (or at least equal to unity).Phase 2
(11)
m
i
n
1
m
∑
i
=
1
m
α
i
s
.
t
.
∑
j
=
1
n
x
-
i
j
=
α
i
∑
j
=
1
n
x
i
j
,
i
=
1
,
…
,
m
∑
k
=
1
n
λ
k
j
x
i
k
≤
x
-
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
∑
k
=
1
n
λ
k
j
y
r
k
≥
y
-
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
j
=
1
n
y
-
r
j
≥
β
r
∗
∑
j
=
1
n
y
-
r
j
,
r
=
1
,
…
,
s
x
-
i
j
≤
x
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
y
-
r
j
≥
y
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
i
=
1
m
c
i
x
i
j
-
x
-
i
j
x
i
j
+
∑
r
=
1
s
d
r
y
-
r
j
-
y
r
j
y
r
j
≤
t
j
,
j
=
1
,
…
,
n
0
≤
α
i
≤
1
,
i
=
1
,
…
,
m
x
-
i
j
,
y
-
r
j
,
λ
k
j
≥
0
,
i
=
1
,
…
,
m
;
r
=
1
,
…
,
s
;
k
,
j
=
1
,
…
,
n
.Model (11) wants to minimize the total input of the all DMU subject to the following: (1) no DMU loses outputs; (2) no DMU can increase its inputs; (3) the total output target is no less than that determined in phase 1; and also (4) no DMU can exceed the difficulty coefficient which the company can accept.(2) Alternative 2Phase 1
(12)
m
i
n
1
m
∑
i
=
1
m
α
i
s
.
t
.
∑
j
=
1
n
x
-
i
j
=
α
i
∑
j
=
1
n
x
i
j
,
i
=
1
,
…
,
m
∑
k
=
1
n
λ
k
j
x
i
k
≤
x
-
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
∑
k
=
1
n
λ
k
j
y
r
k
≥
y
-
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
x
-
i
j
≤
x
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
y
-
r
j
≥
y
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
i
=
1
m
c
i
x
i
j
-
x
-
i
j
x
i
j
+
∑
r
=
1
s
d
r
y
-
r
j
-
y
r
j
y
r
j
≤
t
j
,
j
=
1
,
…
,
n
x
-
i
j
,
y
-
r
j
,
λ
k
j
≥
0
,
i
=
1
,
…
,
m
;
r
=
1
,
…
,
s
;
k
,
j
=
1
,
…
,
n
.Phase 2
(13)
m
a
x
1
s
∑
r
=
1
s
β
r
s
.
t
.
∑
j
=
1
n
y
-
r
j
=
β
r
∑
j
=
1
n
y
r
j
,
r
=
1
,
…
,
s
∑
k
=
1
n
λ
k
j
x
i
k
≤
x
-
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
∑
k
=
1
n
λ
k
j
y
r
k
≥
y
-
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
j
=
1
n
x
-
i
j
≤
α
i
∗
∑
j
=
1
n
x
i
j
,
i
=
1
,
…
,
m
x
-
i
j
≤
x
i
j
,
i
=
1
,
…
,
m
;
j
=
1
,
…
,
n
y
-
r
j
≥
y
r
j
,
r
=
1
,
…
,
s
;
j
=
1
,
…
,
n
∑
i
=
1
m
c
i
x
i
j
-
x
-
i
j
x
i
j
+
∑
r
=
1
s
d
r
y
-
r
j
-
y
r
j
y
r
j
≤
t
j
,
j
=
1
,
…
,
n
x
-
i
j
,
y
-
r
j
,
λ
k
j
≥
0
,
i
=
1
,
…
,
m
;
r
=
1
,
…
,
s
;
k
,
j
=
1
,
…
,
n
,where αi∗ is the optimal value of the input decreased factor obtained in model (12).In addition to the proposed approach being the feature of unit invariant, obviously, an additional important feature is its flexibility. Thus, we can give a different relative weight which can be reflected in decision-maker’s subjective preference for different outputs, inputs, and difficulty coefficients. Assuming a weightwrr=1,…,s for output r to maximize them, it would only be needed to substitute the objective functions in model (9) to (13) by max⁡1/s∑r=1swrβr. Similarly, a different, relative weight δii=1,…,m can be given to input i to minimize them. So we will modify the objective functions in model (9) and (13) by min⁡1/m∑i=1mδiαi. Also a different, relative weight ξjξ=1,…,n can be given to DMU j to minimize them. So we will modify the objective functions in model (9) and (13) by min⁡1/n∑j=1nξjtj.


## 4. Numerical Example

In this section, the advanced characteristic and practical values in our proposed model are demonstrated. To this end, we analyzed resource allocation and target setting simultaneously based on 2012 annual report of 16 sets of chain hotels located in Anhui, China. These hotels belong to the same chain with single central decision-making team to supervise all their branches. The company consists of 16 branches (DMUs), each of which uses two inputs and two outputs. The two output variables are room occupancy rate and turnover. Room occupancy rate is an index of hotel popularity defined by the ratio of number of occupied rooms to total number of guest rooms for the hotel business reference analysis. Turnover profits from room revenue, food and beverage income, and other income. On the other hand, two input variables are fixed assets and operating costs. Fixed assets are from facilities and equipment and other supplies that are used for hotel operations, while rent, staff salaries, office expenses, material consumption, and other expenses form operating costs. The raw data of the example studied in this paper is shown in Table1.Table 1
Data for the illustration example.
DMU
Inputs
Outputs
CCR efficiency
Fixed asset (104 Yuan)
Operating cost (104 Yuan)
Occupancy rate (%)
Turnover (104 Yuan)
1
245.00
284.00
31.27
204.00
0.7874
2
384.00
304.00
38.22
624.00
1.0000
3
229.00
310.00
27.58
324.00
0.8134
4
272.00
311.00
44.09
410.00
1.0000
5
314.00
334.00
40.89
630.00
1.0000
6
266.00
393.00
37.51
494.00
1.0000
7
379.00
493.00
42.85
794.00
1.0000
8
565.00
504.00
56.54
569.00
0.8023
9
625.00
567.00
57.14
582.00
0.7223
10
624.00
627.00
86.30
884.00
0.9875
11
623.00
640.00
51.77
574.00
0.5899
12
599.00
647.00
91.50
769.00
0.9976
13
583.00
698.00
81.60
600.00
0.8635
14
668.00
722.00
83.20
869.00
0.8322
15
754.00
773.00
54.63
838.00
0.5733
16
671.00
776.00
84.40
756.00
0.7760
Average
487.56
523.94
56.84
620.06
0.8591First of all, we can use model (2) to calculate the classic CCR efficiency scores for these 16 hotels. The results are listed in the last column of Table 1. As can be seen, five hotels (2. 4, 5, 6, and 7) are efficient with an efficiency score of one, implying that these hotels are operating very well in the year of 2012 as compared with their peers. On the contrary, the remaining eleven hotels are inefficient, and the lowest efficiency score appears for 15th hotel reaching 0.5733. For these hotels as a whole, the average efficiency score reaches 0.8591, which shows that these chain hotels have realized a relative high performance.Then, we solve model (10)–(13) and obtain the optimization solutions without taking potential limitations of changing the current production into account. Table 2 shows the optimal values of resource allocation and target setting of each DMU in alternative 1. This achieves the total maximum outputs which have precedence over the total minimum input. From Table 2, we can find the average occupancy rate increases from 56.84% to 62.85% and the average turnover increases from 620.06 to 892.92. Also we can find every output of each DMU is no less than the raw data in the existing production. After allocating resource and setting output target, we will find all DMU projecting onto the efficient frontier. DMU2, DMU4, DMU5, DMU6, and DMU7 keep unchanged after resource allocation and target setting.Table 2
Resource allocation and target setting for alternative 1.
DMU
Fixed asset
Operating cost
Occupancy rate
Turnover
Efficiency
1
245.00
260.61
31.90
491.56
1.0000
2
384.00
304.00
38.22
624.00
1.0000
3
229.00
243.59
29.82
459.46
1.0000
4
272.00
311.00
44.09
410.00
1.0000
5
314.00
334.00
40.89
630.00
1.0000
6
266.00
393.00
37.51
494.00
1.0000
7
379.00
493.00
42.85
794.00
1.0000
8
565.00
504.00
62.63
997.63
1.0000
9
625.00
567.00
70.35
1116.86
1.0000
10
624.00
627.00
86.30
945.07
1.0000
11
623.00
640.00
78.57
1218.17
1.0000
12
599.00
647.00
91.50
863.22
1.0000
13
583.00
698.00
81.60
1084.03
1.0000
14
668.00
710.55
86.99
1340.25
1.0000
15
754.00
773.00
94.91
1472.11
1.0000
16
671.00
713.74
87.38
1346.27
1.0000
Average
487.56
513.72
62.85
892.92
1.0000When we will pursue the total minimum input which has precedence over the total maximum outputs. We will use alternative 2 and solve model (12) and model (13) to obtain the optimization solutions. The outcome of alternative 2 will be given in Table 3. From Table 3, we can find the average fixed asset decreases from 487.56 to 384.88 and the average operating cost decreases from 523.94 to 434.58. Also we can find that every input of each adjusted DMU is no more than the original inputs. After allocating resource and setting output target, we will find again that all DMU are fully efficient, which is the same as that of alternative 1.Table 3
Resource allocation and target setting for alternative 2.
DMU
Fixed asset
Operating cost
Occupancy rate
Turnover
Efficiency
1
192.91
220.57
31.27
204.00
1.0000
2
384.00
304.00
38.22
624.00
1.0000
3
186.84
206.86
27.58
324.00
1.0000
4
272.00
311.00
44.09
410.00
1.0000
5
314.00
334.00
40.89
630.00
1.0000
6
266.00
393.00
37.51
494.00
1.0000
7
379.00
493.00
42.85
794.00
1.0000
8
359.49
406.71
56.54
569.00
1.0000
9
365.03
412.29
57.14
582.00
1.0000
10
552.54
623.61
86.30
884.00
1.0000
11
342.27
382.07
51.77
574.00
1.0000
12
564.48
645.42
91.50
769.00
1.0000
13
503.41
575.59
81.60
600.00
1.0000
14
536.84
604.26
83.20
869.00
1.0000
15
418.60
445.56
54.63
838.00
1.0000
16
520.68
595.34
84.40
756.00
1.0000
Average
384.88
434.58
56.84
620.10
1.0000Then we will consider potential limitations of changing the current production. For simplicity and without loss of generality, we will analyze alternative 1. After allocating resource and setting output target, we will find all DMU projecting the efficient frontier. This is impossible to achieve for the next term’s production planning. If the decision-makers do not pay attention to the potential limitations and their abilities of changing the current production condition, they will make some incorrect decisions. So we want to take the problems of restrictions on projecting onto the efficiency frontier which might be very expensive into account. The decision-makers define the difficulty coefficient based on the company’s strategy. If the company can accept the total difficulty coefficient, the company will reach the efficient frontier easily in the next term. Also, the company can save the total input and gain more total output. Now the company identifies the difficulty coefficient matrix which is from the current production to next production condition.


## 5. Conclusion

DEA has been traditionally used for measuring the performance of individual units. Currently, DEA is also a useful approach for solving the problem of resource allocation and target setting popularly, since Lozano and Villa [25] approached such problem by introducing the concept of centralized data envelopment analysis (CDEA) models to minimize the overall resource consumption or to maximize the over output production in an organization, rather than considering each DMU separately. There are some literatures considering the CDEA. In these literatures, they are mainly based on the empirical characterization of production possibility set formed by DEA and projecting the inefficient unit onto the efficient frontier. However, only few works consider achieving or not. This is because the efficient frontier only gives a direction of changing the current production condition during the next term. In this paper, we want to take the limits into account and form a difficulty coefficient matrix of changing the production in the resource allocation and target setting. So as to do that, we want to guarantee managerial feasibility rather than mathematical feasibility in the planning period. So we presented a DEA-based approach for resource allocation and target setting problem. It involves three objectives, namely, output maximization, total resources consumption minimization, and the total minimum accepted difficulty coefficient. This is a multiobjective linear programming. We use the lexicographic order in which these objectives are purposed. Because the accepted difficulty coefficient of each unit is based on the decision-maker preference and the company’s strategy, we investigate the relationship between the total difficulty coefficient and the maximum outputs and minimum inputs. By doing that, the managers of organizations are willing to put in changing the production condition and managerial style and expect the total output increased and the total input saved, that is, the efficiency-gain associated with this resource allocation and target setting. Having such relationship, the managers can choose to stop investing into input allocation and output setting when an accepted level of total output increased and input saved is reached.In this paper we use the CCR model; we also can extend the approach to other DEA models. For instance, we can obtain the scheme of resource allocation and target setting under the condition of variable returns to scale (VRS). In addition, the inputs and outputs are only measured by exact values in our work. Future research can extend the present approach to consider the cases where the inputs and outputs of DMUs are bounded data, ordinal data, and ratio-bounded data. Also, one can take the interaction among DMUs into account. By saying interaction, we mean that DMUs can cooperate, coordinate, and even negotiate towards the completion of the problem of resource allocation and target setting. That is a direction for further research where there are interdependencies between DMUs.



---

*Source: 3826096-2018-02-05.xml*