# New Approach in Fixed Resource Allocation and Target Setting Using Data Envelopment Analysis with Common Set of Weights

Authors: Marzieh Ghasemi; Mohammad Reza Mozaffari; Farhad Hosseinzadeh Lotfi; Mohsen Rostamy malkhalifeh; Mohammad Hasan Behzadi
Journal: Complexity
 (2022)

---

## Abstract

One of the mathematical programming techniques is data envelopment analysis (DEA), which is used for evaluating the efficiency of a set of similar decision-making units (DMUs). Fixed resource allocation and target setting with the help of DEA is a subject that has gained much attention from researchers. A new model was proposed by determining a common set of weights (CSW). All DMUs were involved with the aim of achieving higher efficiency in every DMU after the procedure. The minimum resources and targets allocated to each DMU were commensurate to the efficiency of that DMU and the share of DMU in the input resources and the output productions. To examine the proposed method, other methods in the DEA literature were examined as well, and then, the efficiency of the method was demonstrated through a numerical example.


---

## Body

## 1. Introduction

The original concepts related to DEA were first introduced in 1978 by Charnes et al. [1] and rapidly gained popularity among researchers. By introducing the CCR model, Charnes was able to present a novel method for efficiency measurement in units. A topic that has been of interest to researchers is fixed resource allocation and target setting using DEA.To reduce the costs, the subsidiaries of an organization are forced to cooperate with each other. The costs allocated to the infrastructure are called fixed costs. Another issue that can be discussed in an organization is the method used for fixed resource allocation and target setting. Let us assume that a given organization has limited resources and wants to allocate those resources to its subsidiaries and set targets for them based on their performance. Now, the questions would be how to allocate the resources to the subsidiaries in an equitable manner and how to carry out the target setting.In 1999, Cook and Cross [2] introduced the two axioms of invariance-efficiency and Pareto-minimality and studied the input in the fixed resource allocation problem. In the method proposed by them based on these two axioms, only the equitability of the resource allocation was taken into consideration.The method provided by Cook and Kress [2] was generalized from input-oriented to output-oriented conditions and from CCR to BCC model by Cook and Zhu [3]. Lin [4] proved that no optimal solution would be obtained by adding certain constraints to the method of Cook and Zhu [3]. Lin [4] added some specified purposes to their model to improve this situation and achieve the possible allocation.In 2003, Beasly [5] presented a nonlinear method that maximized the average efficiency of all DMUs. Amirteimoori and Kordrostami [6] indicated that Beasley’s method is not possible in some cases. Accordingly, they introduced a new DEA-based method for targeting and also allocating the fixed resources. In 2017, Jahanshahloo [7] et al. used the concept of CSW and the efficiency invariance axiom to present another method for fixed resource allocation. Furthermore, Jahanshahloo et al. [7] demonstrated that Beasley’s [5] method, which was claimed impossible by Amirteimoori and Kordrostami [6], is always possible. Li et al. [8] extended the work carried out by Jahanshahloo et al. [7].In 2004, using primary and dual problems, Jahanshahloo et al. [9] presented a formula that determined the fixed cost for each DMU without the need to solve any linear problems. In the meantime, Li et al. [10] viewed the problem of fixed resource allocation from a different perspective. They assumed that if there are any other costs as well, the allocated fixed costs shall then be added to these costs. Furthermore, in 2014, Du [11] carried out resource allocation using the concept of cross efficiency.Hosseinzadeh et al. [12] introduced a model using invariance-efficiency principle where each DMU determines the minimum and maximum value that can participate in receiving fixed resources. Then, the convex combination of these values is considered as the fixed allocated resources. The resource allocation was conducted by Asgharinia et al. [13] using CSW. Amirteimoori et al. [14] and Hosseinzadeh et al. [15] studied resource allocation and targeting with the CSW.In the CSW method, the ratio of weighted outputs to weighted inputs is simultaneously maximized for all DMUs. Thompson et al. [16,17], Cook et al. [18], Charnes et al. [19], and Roll et al. [20] have studied some of the CSW concepts. Jahanshahloo et al. [21, 22] introduced a multiobjective model for efficiency measurement through the CSW method in one study. Moreover, in another study, using the infinity norm, they proposed a nonlinear method for solving the CSW model. Furthermore, Cook and Zhu [23] utilized goal programming to solve the CSW model, and Davoodi and Rezai [24] suggested a linear method for the same purpose. Kachouei et al. [25] used CSW to efficiency evaluation in DEA with undesirable outputs when data is fuzzy.The technique proposed in the current manuscript considers certain conditions that force the participation of all DMUs in the resource allocation and target setting. Imagine that a company wants to provide some resources to its subsidiaries in order for them to produce new products, while the amount of resources allocated to each subsidiary is to be in accordance with the performance of that subsidiary and its inputs relative to the inputs of the other subsidiaries [26–28]. Moreover, the company intends to set a target for each subsidiary based on its efficiency and its outputs relative to the outputs of the other subsidiaries [29–31]. In this manuscript, we consider the fixed resources as an additional input and the target setting as an output, and then using a CSW, we present a model that, while including all DMUs in the resource allocation and target setting, ensures that, after the procedure, the efficiency of all DMUs would be the same as before or higher.Section2 is devoted to basic models used in this paper. Section 3 describes the novel method proposed in this paper. In Section 4, the novel method is applied to a numerical example. And finally, Section 5 is dedicated to the conclusions and recommendations.


## 2. Background

This segment describes CCR model. Then, we present the CSW model.


### 2.1. CCR Model

Assume thatxiji=1,…,m and yrjr=1,…,s are the inputs and outputs consumed and produced by DMUjj=1,…,n, respectively. Also, let v be the weight related to the inputs and u the weight related to the outputs. CCR model [1] is as follows:(1)θo∗=max∑r=1suryro,s.t:∑i=1mvixio=1,∑r=1suryrj−∑i=1mvixij≤0,j=1,…,nur,vi≥0,r=1,…,si=1,…,m.Definition 1.
(CCR efficiency).
DMUo is CCR-efficient if θo∗=1 and there exists at least one optimal u∗,v∗ with u∗>0 and v∗>0. Otherwise, DMUo is CCR-inefficient.


### 2.2. Common Set of Weights (CSW) Model

Model 1 must be solvedn times to assess n DMUs. Model 1 is assessed through the best weights. To resolve this problem and obtain just a CSW for all DMUs and evaluate all DMUs based on a CSW, the CSW model can be used as follows [22]:(2)Max∑r=1suryr1∑i=1mvixi1,∑r=1suryr2∑i=1mvixi2,…,∑r=1suryrn∑i=1mvixin,s.t:∑r=1suryrj∑i=1mvixij≤1,i=1,…,n,ur,vi≥ε,i=1,…,n.Different methods have been proposed for solving this multiobjective fractional model (2). Goal programming (GP) is one of these methods [32–35]. In goal programming, the decision maker specifies certain levels for achieving the objectives. Moreover, the decision maker allows deviation from the goals and, therefore, creates flexibility in the decision-making process. Also, the objective function seeks to minimize the undesirable deviations. Based on the GP method, model (2) can be transformed into the following nonlinear model in order to identify a set of common weights:(3)Min∑j=1nsj−+sj+,s.t:∑r=1suryrj∑i=1mvixij+sj−−sj+=Aj,z=1,…,n,∑r=1suryrj∑i=1mvixij≤1j=1,…,n,sj−,sj+≥0,ur,vi≥ε,j=1,…,n,i=1,…,m,r=1,…,s.where Aj denotes the goal of the j th objective. sj− and sj+ are negative and positive deviations from the objective, respectively. Technically, the deviational variables sj− and sj+ help the objective function j to achieve the goal Aj=1. Thereby, the positive deviation is equal to zero here, i.e., sj+=0. Thus, the first constraint can be reformulated as follows:(4)∑r=1suryrj+sj−∑i=1mvixij=∑i=1mvixij,j=1,…,n.Considering the nonlinear constraint above, model (3) cannot be transformed into a linear model. In order to achieve the goal of DMUj (efficiency scores of one), the numerator should increase in the fraction ∑r=1suryrj/∑i=1mvixij while the denominator is decreased. Therefore, model (3) can be reformulated as follows:(5)Min∑j=1nsj−+sj+,s.t:∑r=1suryrj+sj+∑i=1mvixij−sj−=1,j=1,…,n,∑r=1suryrj∑i=1mvixij≤1,j=1,…,n,sj−,sj+≥0,ur,vi≥ε,j=1,…,n,i=1,…,m,r=1,…,s.Obviously, based on the first constraint of model (4), the second constraint is redundant and can be removed from the model. Therefore, the model can be formulated in the following linear form:(6)Min∑j=1nsj−+sj+,s.t:∑r=1suryrj−∑i=1mvixij+sj++sj−=0,j=1,…,n,sj−,sj+≥0,ur,vi≥εj=1,…,n,i=1,…,m,r=1,…,s.By settingsj−+sj+=sj, the model is transformed as follows:(7)Min∑j=1nSj,s.t:∑r=1suryrj−∑i=1mvixij+Sj=0,j=1,…,n,Sj≥0,ur,vi≥εj=1,…,n,i=1,…,m,r=1,…,s.If we letur∗,vi∗,sj∗ be the optimal solution of model (6), the CSW-efficiency of DMUj is calculated as follows:(8)θjcsw∗=∑r=1sur∗yrj∑i=1mvr∗yij=1−sj∗∑i=1mvi∗yij,j=1,…,n.Definition 2.
IfθOcsw∗=1, then DMUO is efficient with the CSW resulting from model 2 and otherwise DMUO is inefficient of common weights.


## 2.1. CCR Model

Assume thatxiji=1,…,m and yrjr=1,…,s are the inputs and outputs consumed and produced by DMUjj=1,…,n, respectively. Also, let v be the weight related to the inputs and u the weight related to the outputs. CCR model [1] is as follows:(1)θo∗=max∑r=1suryro,s.t:∑i=1mvixio=1,∑r=1suryrj−∑i=1mvixij≤0,j=1,…,nur,vi≥0,r=1,…,si=1,…,m.Definition 1.
(CCR efficiency).
DMUo is CCR-efficient if θo∗=1 and there exists at least one optimal u∗,v∗ with u∗>0 and v∗>0. Otherwise, DMUo is CCR-inefficient.


## 2.2. Common Set of Weights (CSW) Model

Model 1 must be solvedn times to assess n DMUs. Model 1 is assessed through the best weights. To resolve this problem and obtain just a CSW for all DMUs and evaluate all DMUs based on a CSW, the CSW model can be used as follows [22]:(2)Max∑r=1suryr1∑i=1mvixi1,∑r=1suryr2∑i=1mvixi2,…,∑r=1suryrn∑i=1mvixin,s.t:∑r=1suryrj∑i=1mvixij≤1,i=1,…,n,ur,vi≥ε,i=1,…,n.Different methods have been proposed for solving this multiobjective fractional model (2). Goal programming (GP) is one of these methods [32–35]. In goal programming, the decision maker specifies certain levels for achieving the objectives. Moreover, the decision maker allows deviation from the goals and, therefore, creates flexibility in the decision-making process. Also, the objective function seeks to minimize the undesirable deviations. Based on the GP method, model (2) can be transformed into the following nonlinear model in order to identify a set of common weights:(3)Min∑j=1nsj−+sj+,s.t:∑r=1suryrj∑i=1mvixij+sj−−sj+=Aj,z=1,…,n,∑r=1suryrj∑i=1mvixij≤1j=1,…,n,sj−,sj+≥0,ur,vi≥ε,j=1,…,n,i=1,…,m,r=1,…,s.where Aj denotes the goal of the j th objective. sj− and sj+ are negative and positive deviations from the objective, respectively. Technically, the deviational variables sj− and sj+ help the objective function j to achieve the goal Aj=1. Thereby, the positive deviation is equal to zero here, i.e., sj+=0. Thus, the first constraint can be reformulated as follows:(4)∑r=1suryrj+sj−∑i=1mvixij=∑i=1mvixij,j=1,…,n.Considering the nonlinear constraint above, model (3) cannot be transformed into a linear model. In order to achieve the goal of DMUj (efficiency scores of one), the numerator should increase in the fraction ∑r=1suryrj/∑i=1mvixij while the denominator is decreased. Therefore, model (3) can be reformulated as follows:(5)Min∑j=1nsj−+sj+,s.t:∑r=1suryrj+sj+∑i=1mvixij−sj−=1,j=1,…,n,∑r=1suryrj∑i=1mvixij≤1,j=1,…,n,sj−,sj+≥0,ur,vi≥ε,j=1,…,n,i=1,…,m,r=1,…,s.Obviously, based on the first constraint of model (4), the second constraint is redundant and can be removed from the model. Therefore, the model can be formulated in the following linear form:(6)Min∑j=1nsj−+sj+,s.t:∑r=1suryrj−∑i=1mvixij+sj++sj−=0,j=1,…,n,sj−,sj+≥0,ur,vi≥εj=1,…,n,i=1,…,m,r=1,…,s.By settingsj−+sj+=sj, the model is transformed as follows:(7)Min∑j=1nSj,s.t:∑r=1suryrj−∑i=1mvixij+Sj=0,j=1,…,n,Sj≥0,ur,vi≥εj=1,…,n,i=1,…,m,r=1,…,s.If we letur∗,vi∗,sj∗ be the optimal solution of model (6), the CSW-efficiency of DMUj is calculated as follows:(8)θjcsw∗=∑r=1sur∗yrj∑i=1mvr∗yij=1−sj∗∑i=1mvi∗yij,j=1,…,n.Definition 2.
IfθOcsw∗=1, then DMUO is efficient with the CSW resulting from model 2 and otherwise DMUO is inefficient of common weights.


## 3. Proposed Model

Assume thatxiji=1,…,m and yrjr=1,…,s are the inputs and outputs consumed and produced by DMUjj=1,…,n, respectively. Now, consider a fixed resource F and a general target G that we want to equitably allocate to the DMUs. We consider fjj=1,…,n as the variable related to fixed resources and gjj=1,…,n as the variable related to target setting in DMUj. It is obvious that(9)∑j=1nfj=F,∑j=1ngj=G.The efficiency score ofDMUj when the resources are not allocated and the target is not set is represented by θj∗, which is calculated using the multiplier CCR model. We consider the fixed resource as an additional input with the weight vm+1, and the target corresponding to DMUj as a new output with the weight us+1. In our approach, we carry out the fixed resource allocation and target setting in a way that the efficiency of each DMU after the procedure would be higher than or the same as the previous efficiency. That is:(10)θj∗≤∑r=1suryrj+us+1gj∑i=1mvixij+vm+1f,j=1,…,n.We also intend to achieve maximum efficiency through a CSW. Therefore, our objective is(11)max∑r=1suryr1+us+1g1∑i=1mvixi1+vm+1f1,…,∑r=1suryrm+us+1gn∑i=1mvixin+vm+1fn.We believe that all DMUs must be involved in the resource allocation and target setting. Therefore, for each DMU, we consider the least share in the allocated resources and the set targets. If the share that each DMU has in the inputs is multiplied by the efficiency of that DMU and the amount of fixed resources, the resulting value can be considered as a lower bound for the amount of fixed resources that DMU should receive. Also, if the share that each DMU has in the produced outputs is multiplied by the efficiency of that DMU and the overall target, the obtained value can be considered as a lower bound for target setting. To achieve our goals, we proceed as follows:Ifλj=1/m∑i=1mxij/∑t=1nxit and μj=1/s∑r=1myrj/∑t=1nyrt are the shares of DMUj in the input resources and the produced outputs, respectively, and θj∗ stands for the efficiency of DMUj prior to the allocation of fixed resources and target setting, which is obtained using the multiplier CCR model, then the minimum resources for DMUj would be equal to θj∗λjF, and the minimum target set for DMUj would equal θj∗μjG. This means that the minimum fixed resources that each DMU would receive equals the amount of inputs it has consumed multiplied by its efficiency in achieving those inputs. Furthermore, the minimum target set for each DMU is equal to its outputs and the efficiency that it has had before fixed resource allocation. Therefore, any DMU that has a larger share in the inputs and can achieve higher efficiency with those inputs needs to receive more resources. And similarly, a higher target is set for any DMU that has higher efficiency and a larger contribution in the output generation. Therefore, the general model is formulated as follows:(12a)max∑r=1suryr1+us+1g1∑i=1mvixi1+vm+1f1,…,∑r=1suryrm+us+1gn∑i=1mvixin+vm+1fn,s.t:θj∗≤∑r=1suryrj+us+1gj∑i=1mvixij+vm+1fj≤1,j=1,…,n,(12b)fj≥θj∗λjF≤j=1,…,n,(12c)gj≥θj∗μjG,j=1,…,n,(12d)∑j=1nfj=F,j=1,…,n,(12e)∑j=1ngj=G,j=1,…,n,fj,gj,ur,vi,us+1,vm+1≥ε,j=1,…,n,r=1,…,s,i=1,…,m.The constraint (12a) assures that the efficiency of each DMU after allocating the resources and targeting is more than its efficiency before allocating the resources and targeting. The constraint (12b) represents the minimum amount allocated to the DMU. The constraint (12c) ensures the participation of all DMUs in targeting. The constraints (12d) and (12e) indicate that the total resources received and the total objective designated are equal to the amount of resources and the intended purpose of the decision maker, respectively.Theorem 1.
Model (10) is bounded.Proof.
Suppose thatf¯j,g¯j,u¯r,v¯i,u¯s+1,v¯m+1 is a feasible solution for model (10). Therefore, this answer applies to all constraints of the matter. Hence, per j, we have(13)∑r=1su¯ryrj+u¯s+1g¯j∑i=1mv¯ixij+v¯m+1f¯j≤1.
This constraint represents that all objective functions of the fractional multiobjective model (10) are less than or equal to 1. On the other hand, since the objective function is in the form of maximizing, the maximum possible value of the objective function is less than or equal to 1. Then, the model is bounded.
Model 10 is a nonlinear multiobjective model. We convert this model into a single-objective linear model. By settingvm+1fj=fj′ and us+1gj=gj′ , model (10) would change as follows:(14)max∑r=1suryr1+g1′∑i=1mvixi1+f1′,…,∑r=1suryrn+gn′∑i=1mvixin+fn′,s.t:θj∗≤∑r=1suryrj+g1′∑i=1mvixij+fj′≤1,j=1,…,n,fj′≥vm+1θj∗λjF,j=1,…,n,gj′≥us+1θj∗μjG,j=1,…,n,∑j=1nfj′=vm+1F,j=1,…,n,∑j=1ngj′=us+1G,j=1,…,n,fj′,gj′,ur,vi,us+1,vm+1≥ε,j=1,…,n,r=1,…,s,i=1,…,m.
Now, we change the multiobjective model into a linear single-objective model that can help us achieve our goals. To maximize the objective function, all we need to do is to maximize the numerator and minimize the denominator. As such, the proposed model can be rewritten as(15)max∑r=1suryr1+g1′−∑i=1mvixi1−f1′,…,∑r=1suryrn+gn′−∑i=1mvixin−fn′s.t∑r=1suryrj+gj′−∑i=1mvixij−fj′≤0,j=1,…,n,s.t:∑r=1suryrj+gj′−θj∗∑i=1mvixij−θj∗fj′≥0,j=1,…,n,fj′≥vm+1θj∗λjF,j=1,…,n,gj′≥us+1θj∗μjG,j=1,…,n,∑j=1nfj′=vm+1F,j=1,…,n,∑j=1ngj′=us+1G,j=1,…,n,fj′,gj′,ur,vi,us+1,vm+1≥ε,i=1,…,m,r=1,…,s,j=1,…,n.
By converting the first constraint into an equation and changing theMax to Min, model (15) would change as follows:(16)minS1,…,Sn,s.t∑r=1suryrj+gj′−∑i=1mvixij−fj′+Sj=0,j=1,…,n,s.t:∑r=1suryrj+gj′−θj∗∑i=1mvixij−θj∗fj′≥0,j=1,…,n,fj′≥vm+1θj∗λjF,j=1,…,n,gj′≥us+1θj∗μjGj=1,…,n,∑j=1nfj′=vm+1F,j=1,…,n,∑j=1ngj′=us+1G,j=1,…,n,fj′,gj′,Sj≥0,ur,vi,us+1,vm+1≥ε,j=1,…,n,r=1,…,s,i=1,…,m.
Model (16) is a multiobjective model whose goal is to minimize the covariates Sj. We convert the multiobjective model to the single-objective model (17) using the goal programming technique.(17)min∑j=1nSj,s.t:∑r=1suryrj+gj′−∑i=1mvixij−fj′+Sj=0,j=1,…,ns.t:∑r=1suryrj+gj′−θj∗∑i=1mvixij−θj∗fj′≥0,j=1,…,nfj′≥vm+1θj∗λjF,j=1,…,n,gj′≥us+1θj∗μjG,j=1,…,n,∑j=1nfj′=vm+1F,j=1,…,n,∑j=1ngj′=us+1G,j=1,…,n,fj′,gj′,Sj≥0ur,vi,us+1,vm+1≥ε,j=1,…,n,r=1,…,s≤i=1,…,m.
Model (17) is a single-objective linear model that we employ to perform the resource allocation and targeting.Theorem 2.
A feasible solution to the model (17) is always available.Proof.
By settingvm+1=us+1=ε, fj′=ελjF, and gj′=εμjG, the constraints 4, 5, 6, and 7 are satisfied:(18)∑j=1nfj′=∑j=1nελjF=εF=vm+1F,∑j=1ngj′=∑j=1nεμjG=εG=us+1G,vm+1θj∗λjF≤ε×1×λj×F=fj′,us+1θj∗μjG≤ε×1×μj×G=gj′.
By settingur=ε/βα+F and vi=ε, where(19)α=max1≤j≤n∑i=1mxij,β=min1≤j≤n∑r=1syrj,
the second constraint is also satisfied.(20)θj∗∑i=1mvixij+θj∗fj′=θj∗∑i=1mvixij+fj′≤1×∑i=1mvixij+fj′≤εα+ελjF=εα+λjF=εβα+λjFβ≤εβα+F∑r=1syrj=∑r=1suryrj≤∑r=1suryrj+gj′.
Now, by setting(21)Sj=−εβα+F∑r=1syrj−μjG+ε∑i=1mxij+λjF,j=1,…,n,
the first constraint is also satisfied.Theorem 3.
Using model (17) for allocation or resource and setting target improve the efficiency.Proof.
Assume thatur∗,vi∗,fj′∗,gj′∗,vm+1∗,us+1∗ is the best solution for the abovementioned model. Therefore:(22)θjnew=∑r=1sur∗yrj+gj′∗∑i=1mvr∗xij+fj′∗≥θj∗∑r=1svi∗xij+θj∗fj′∗∑i=1mvi∗xij+fj′∗=θj∗.


## 4. Examples

In this section, we will implement a numerical example and a practical example for the proposed method.


### 4.1. Numerical Example

Here, for an in-depth comparison, the fixed cost allocation problem of Cook and Kress [2] is used as a numerical example in order to display the application of the resource allocation and target setting approach. This information is given in Table 1. There are 12 DMUs using 3 inputs to generate 2 outputs. Several studies have used the same example, so it is considered as a key case of resource allocation and target setting without any targets to adjust. Therefore, in this example, G=0. The objective is to allocate a common resource F=100 (meaning a common cost in this context).Table 1
A simple example.
DMUx1x2x3y1y2135039967751229826873611342231775584428116970665530116675445636029178310707540181072457827633578590932325575107410444646741072113232552535012444646101199The column 4 of Table2 provides the efficiency scores of the DMUs calculated using the multiplier CCR model. The efficiency calculations have been carried out using the GAMS software. These calculations merely took a few seconds to finish. The share of each DMU in the input resources λj was calculated using EXCEL, which can be observed in column three of the table. By implementing the proposed model, the cost allocated to each DMU was determined, the results of which are reported in column two of Table 2. And finally, column 5 presents the performance of any DMU following the fixed costs allocation.Table 2
Results.
DMUFixed costλjCCR efficiencyBeforeAfter17.5290.0930.7571.00027.9850.0740.9231.00037.4360.0840.7471.00048.3630.0681.0001.00057.6470.0581.0001.000610.9080.1130.9611.00077.9720.0930.8600.86088.2030.0681.0001.000910.4870.0641.0001.000109.2080.1110.8320.959112.1400.0640.3331.0001212.1220.1111.0001.000The largest contribution in paying the fixed costs is related to DMU 12, which is an efficient DMU and the second DMU with the highest share in the input resources. The lowest contribution is related to DMU 11, which is the least efficient DMU and has a lower share in the inputs compared with other DMUs. Among the efficient DMUs, the lowest contribution in paying the fixed costs is related to DMU5, because it has the lowest share in the input resources. Among the inefficient DMUs, the largest contribution belongs to DMU6, as it has the largest share in the input resources [36–39]. DMUs 1 and 7 have the same share in the inputs resources; however, DMU 7 is more efficient than DMU 1, and as seen in column one of Table 2, DMU 7 has a larger contribution in paying the fixed costs. DMUs 10 and 12 also have the same share in the inputs, but the fixed cost allocated to DMU 12 is greater than that of DMU 10. The reason is that DMU 12 is efficient, while DMU 10 is inefficient. DMUs 9 and 11 also have the same share in the input resources, but there is a large difference in the contribution they make to the fixed costs. The reason is that DMU 9 is an efficient DMU, while DMU 11 has the lowest efficiency score among DMUs. Moreover, the efficiency of all DMUs were improved after allocating the fixed costs, except for DMU 7 whose efficiency did not change at all.To illustrate some of the important specifications of the proposed approach, the obtained results are compared with a few other methods as well. The idea of resource allocation based on common weights has been investigated by Beasley [5], Hosseinzadeh et al. [15], Si et al. [40], and Li et al. [10]. All these methods take an approach to resource allocation in which a CSW is determined aiming to achieve maximum efficiency. The results of these comparisons are shown in Table 3.Table 3
Allocations using common weights.
DMUSuggested methodBeasly (2003)Si (2003)Hosseinzadeh (2013)Li (2017)17.5296.787.64758.1998.761127.9857.218.41187.4627.868937.4366.838.62164.2849.966348.3638.478.10919.3016.966157.6477.088.69384.8077.4589610.90810.069.566915.3708.629677.9725.098.333308.322488.2037.749.96287.3397.7280910.48715.118.650516.3307.5359109.20810.088.345711.5988.8650112.1401.582.803207.56561212.12213.9711.85415.31010.3291In the method proposed by Beasley [5], the largest contribution in paying the fixed costs is related to DMU 9. Although DMU 9 is an efficient DMU, it has a small share in the use of input resources as compared with other DMUs. Meanwhile, in our proposed method, the highest payout is related to DMU 12, which is an efficient DMU and is the second DMU with the highest share in the input resources. In all methods, except Li et al. [10], the lowest contribution to fixed costs is related to DMU 11, which has the lowest efficiency score and the lowest share in the input resources. In Li et al. [10], DMU 11 does have the lowest efficiency and the lowest share in the inputs, but the contribution it makes to the fixed costs is greater than that of DMU 9, which is an efficient DMU with a higher share than DMU 11 in the use of input resources. Meanwhile, according to our proposed method, DMU 9 has higher contribution to the fixed costs than DMU 11. In the method presented by Hosseinzadeh et al. [15], DMUs 7 and 11 make no contribution to the fixed costs. DMUs 1 and 7 have the same share of input resources, and DMU 7 has a higher efficiency score than DMU 1. \However, in Hosseinzadeh et al. [15], DMU 7 has no contribution in paying the fixed costs at all, while DMU 1 pays a fixed cost equaling 8.199. In our proposed method, the fixed costs paid by these two DMUs are extremely close to each other, with DMU 7 paying a slightly greater cost. Moreover, in the method provided by Li et al. [10], DMU 3 has the second highest contribution in paying the fixed costs, while it is in the sixth place in terms of the input resources it receives; therefore, it is an inefficient DMU. Furthermore, DMUs 4 and 5 are both efficient, but DMU 4 has a larger share than DMU 5 in the use of input resources, although DMU 4 makes a smaller contribution than DMU 5 in paying the fixed costs. On the other hand, DMU 9, which is an efficient DMU, has a lower contribution in paying the fixed costs.


### 4.2. An Empirical Example

Kao and Hwang [41] studied the effect of information technology (IT) on the efficiency of banks. We used the same data used in that study, which was related to 27 banks, in order to demonstrate the capability of our proposed method. The inputs included the IT budget (X1), fixed assets (X2), and number of employees (X3), and the outputs were the value of deposits (Y1) and profits earned (Y2). Columns two to six of Table 4 present a list of data sets.Table 4
An empirical example.
DMUx1x2x3y1y2fjgjθθnew10.1500.71313.314.4780.2321.7090.5670.6020.84520.1701.07116.919.5020.3402.3470.8050.6070.88630.2351.2242420.9520.3632.2430.6960.4900.78340.2110.3632413.9020.2111.1290.3560.4040.65250.1330.40915.615.2060.2371.7360.6180.6330.85760.4975.84618.48581.1861.10312.1164.8691.0001.00070.0600.91856.4281.1861.10310.5994.8691.0001.00080.0711.2351211.4410.1991.2530.3250.4180.71291.50018.1289.51124.0721.85815.2093.3080.4240.668100.1201.82119.817.4250.2741.8380.4540.4040.663110.1201.91519.817.4250.2741.83318.7900.4401.000120.0500.87413.114.3420.1771.6910.4650.3960.725130.3706.91812.532.4910.6484.4000.9290.5650.731140.4404.43241.947.6530.6365.6111.3890.3900.691150.4314.50441.152.630.7416.4611.7440.5430.744160.1101.24114.417.4930.2432.1260.6050.5710.768170.0530.4507.69.5120.0671.1750.2940.6670.668180.3455.89215.542.4691.0025.9501.8970.5520.990190.1280.97312.618.9870.2432.4650.8160.7370.847200.0550.4445.67.5460.1530.9520.3670.6581.000210.0570.5085.77.5950.1230.9510.3080.6190.862220.0980.37014.116.9060.2332.0850.7940.7780.898230.1040.39514.617.2640.2632.1200.8370.7460.933240.2062.68019.636.430.6014.9131.7090.7100.935250.0670.78110.511.5810.1201.3630.3370.5470.663260.1000.87212.122.2070.2483.0191.1220.9200.887270.01061.75712.720.670.2532.7040.7300.6180.759First, we calculate the efficiency of the DMUs, as presented in the ninth column of table. As can be observed in this column, two DMUs are efficient. Now, assume that the board of directors in a bank intend to allocate one hundred million dollars of the resources available to them to different branches for equipment updates, and expect that, as a result of this allocation, a total of fifty million dollars be earned by the different branches. Column seven shows the budget allocated to each branch. In the tenth column, the target set for each branch can be observed. As can be seen in these columns, all DMUs are involved in the resource allocation and target setting. In the last column, efficiency scores are calculated after resource allocation and target setting. As can be observed in the table, DMUs 6 and 7 were efficient before resource allocation and target setting, and they are still efficient after the allocation. Moreover, DMUs 11 and 20, which were inefficient before allocation, have become efficient after the allocation. According to the last two columns in the table, the efficiency of all DMUs has either increased after resource allocation or remained the same as before allocation. The number of efficient DMUs has increased from 2 to 4. The lowest efficiency score belongs to DMU 14. The highest amount of allocated resources belongs to DMU 9, and as can be seen, it has the highest amount of inputs and outputs among all DMUs. After DMU 9, most of the allocated resources are related to DMUs 6 and 7, respectively, both of which are efficient. And they remain efficient after allocating resources and setting targets.The lowest amount of allocated resources pertains to DMU 21, which has a lower amount of inputs compared with other DMUs. And then the lowest allocation belongs to DMUs 20 and 4, respectively, both of which are inefficient. DMU 11 has had the highest amount of changes in efficiency, the reason for which can be related to the target set for the DMU. DMUs 4 and 10 had the same efficiency before allocation, but their efficiency scores changed after the resource allocation and target setting. The reason for this could be related to their inputs, as DMU 10 has a lower ratio of inputs to overall inputs than DMU 4.Based on the efficiency scores after resource allocation and target setting, the lowest amount of changes in efficiency is related to DMU 17, which is an inefficient DMU and the least targeting has been done for it. Moreover, its received resources are less than other DMUs. The reason for this is that the lowest target was set for this DMU, and it also has received a lower amount of resources than other DMUs, which was itself due to the DMU having a lower amount of inputs and outputs compared with other DMUs. The highest amount of changes is observed in DMU 11, as the highest target was set for this DMU.


## 4.1. Numerical Example

Here, for an in-depth comparison, the fixed cost allocation problem of Cook and Kress [2] is used as a numerical example in order to display the application of the resource allocation and target setting approach. This information is given in Table 1. There are 12 DMUs using 3 inputs to generate 2 outputs. Several studies have used the same example, so it is considered as a key case of resource allocation and target setting without any targets to adjust. Therefore, in this example, G=0. The objective is to allocate a common resource F=100 (meaning a common cost in this context).Table 1
A simple example.
DMUx1x2x3y1y2135039967751229826873611342231775584428116970665530116675445636029178310707540181072457827633578590932325575107410444646741072113232552535012444646101199The column 4 of Table2 provides the efficiency scores of the DMUs calculated using the multiplier CCR model. The efficiency calculations have been carried out using the GAMS software. These calculations merely took a few seconds to finish. The share of each DMU in the input resources λj was calculated using EXCEL, which can be observed in column three of the table. By implementing the proposed model, the cost allocated to each DMU was determined, the results of which are reported in column two of Table 2. And finally, column 5 presents the performance of any DMU following the fixed costs allocation.Table 2
Results.
DMUFixed costλjCCR efficiencyBeforeAfter17.5290.0930.7571.00027.9850.0740.9231.00037.4360.0840.7471.00048.3630.0681.0001.00057.6470.0581.0001.000610.9080.1130.9611.00077.9720.0930.8600.86088.2030.0681.0001.000910.4870.0641.0001.000109.2080.1110.8320.959112.1400.0640.3331.0001212.1220.1111.0001.000The largest contribution in paying the fixed costs is related to DMU 12, which is an efficient DMU and the second DMU with the highest share in the input resources. The lowest contribution is related to DMU 11, which is the least efficient DMU and has a lower share in the inputs compared with other DMUs. Among the efficient DMUs, the lowest contribution in paying the fixed costs is related to DMU5, because it has the lowest share in the input resources. Among the inefficient DMUs, the largest contribution belongs to DMU6, as it has the largest share in the input resources [36–39]. DMUs 1 and 7 have the same share in the inputs resources; however, DMU 7 is more efficient than DMU 1, and as seen in column one of Table 2, DMU 7 has a larger contribution in paying the fixed costs. DMUs 10 and 12 also have the same share in the inputs, but the fixed cost allocated to DMU 12 is greater than that of DMU 10. The reason is that DMU 12 is efficient, while DMU 10 is inefficient. DMUs 9 and 11 also have the same share in the input resources, but there is a large difference in the contribution they make to the fixed costs. The reason is that DMU 9 is an efficient DMU, while DMU 11 has the lowest efficiency score among DMUs. Moreover, the efficiency of all DMUs were improved after allocating the fixed costs, except for DMU 7 whose efficiency did not change at all.To illustrate some of the important specifications of the proposed approach, the obtained results are compared with a few other methods as well. The idea of resource allocation based on common weights has been investigated by Beasley [5], Hosseinzadeh et al. [15], Si et al. [40], and Li et al. [10]. All these methods take an approach to resource allocation in which a CSW is determined aiming to achieve maximum efficiency. The results of these comparisons are shown in Table 3.Table 3
Allocations using common weights.
DMUSuggested methodBeasly (2003)Si (2003)Hosseinzadeh (2013)Li (2017)17.5296.787.64758.1998.761127.9857.218.41187.4627.868937.4366.838.62164.2849.966348.3638.478.10919.3016.966157.6477.088.69384.8077.4589610.90810.069.566915.3708.629677.9725.098.333308.322488.2037.749.96287.3397.7280910.48715.118.650516.3307.5359109.20810.088.345711.5988.8650112.1401.582.803207.56561212.12213.9711.85415.31010.3291In the method proposed by Beasley [5], the largest contribution in paying the fixed costs is related to DMU 9. Although DMU 9 is an efficient DMU, it has a small share in the use of input resources as compared with other DMUs. Meanwhile, in our proposed method, the highest payout is related to DMU 12, which is an efficient DMU and is the second DMU with the highest share in the input resources. In all methods, except Li et al. [10], the lowest contribution to fixed costs is related to DMU 11, which has the lowest efficiency score and the lowest share in the input resources. In Li et al. [10], DMU 11 does have the lowest efficiency and the lowest share in the inputs, but the contribution it makes to the fixed costs is greater than that of DMU 9, which is an efficient DMU with a higher share than DMU 11 in the use of input resources. Meanwhile, according to our proposed method, DMU 9 has higher contribution to the fixed costs than DMU 11. In the method presented by Hosseinzadeh et al. [15], DMUs 7 and 11 make no contribution to the fixed costs. DMUs 1 and 7 have the same share of input resources, and DMU 7 has a higher efficiency score than DMU 1. \However, in Hosseinzadeh et al. [15], DMU 7 has no contribution in paying the fixed costs at all, while DMU 1 pays a fixed cost equaling 8.199. In our proposed method, the fixed costs paid by these two DMUs are extremely close to each other, with DMU 7 paying a slightly greater cost. Moreover, in the method provided by Li et al. [10], DMU 3 has the second highest contribution in paying the fixed costs, while it is in the sixth place in terms of the input resources it receives; therefore, it is an inefficient DMU. Furthermore, DMUs 4 and 5 are both efficient, but DMU 4 has a larger share than DMU 5 in the use of input resources, although DMU 4 makes a smaller contribution than DMU 5 in paying the fixed costs. On the other hand, DMU 9, which is an efficient DMU, has a lower contribution in paying the fixed costs.


## 4.2. An Empirical Example

Kao and Hwang [41] studied the effect of information technology (IT) on the efficiency of banks. We used the same data used in that study, which was related to 27 banks, in order to demonstrate the capability of our proposed method. The inputs included the IT budget (X1), fixed assets (X2), and number of employees (X3), and the outputs were the value of deposits (Y1) and profits earned (Y2). Columns two to six of Table 4 present a list of data sets.Table 4
An empirical example.
DMUx1x2x3y1y2fjgjθθnew10.1500.71313.314.4780.2321.7090.5670.6020.84520.1701.07116.919.5020.3402.3470.8050.6070.88630.2351.2242420.9520.3632.2430.6960.4900.78340.2110.3632413.9020.2111.1290.3560.4040.65250.1330.40915.615.2060.2371.7360.6180.6330.85760.4975.84618.48581.1861.10312.1164.8691.0001.00070.0600.91856.4281.1861.10310.5994.8691.0001.00080.0711.2351211.4410.1991.2530.3250.4180.71291.50018.1289.51124.0721.85815.2093.3080.4240.668100.1201.82119.817.4250.2741.8380.4540.4040.663110.1201.91519.817.4250.2741.83318.7900.4401.000120.0500.87413.114.3420.1771.6910.4650.3960.725130.3706.91812.532.4910.6484.4000.9290.5650.731140.4404.43241.947.6530.6365.6111.3890.3900.691150.4314.50441.152.630.7416.4611.7440.5430.744160.1101.24114.417.4930.2432.1260.6050.5710.768170.0530.4507.69.5120.0671.1750.2940.6670.668180.3455.89215.542.4691.0025.9501.8970.5520.990190.1280.97312.618.9870.2432.4650.8160.7370.847200.0550.4445.67.5460.1530.9520.3670.6581.000210.0570.5085.77.5950.1230.9510.3080.6190.862220.0980.37014.116.9060.2332.0850.7940.7780.898230.1040.39514.617.2640.2632.1200.8370.7460.933240.2062.68019.636.430.6014.9131.7090.7100.935250.0670.78110.511.5810.1201.3630.3370.5470.663260.1000.87212.122.2070.2483.0191.1220.9200.887270.01061.75712.720.670.2532.7040.7300.6180.759First, we calculate the efficiency of the DMUs, as presented in the ninth column of table. As can be observed in this column, two DMUs are efficient. Now, assume that the board of directors in a bank intend to allocate one hundred million dollars of the resources available to them to different branches for equipment updates, and expect that, as a result of this allocation, a total of fifty million dollars be earned by the different branches. Column seven shows the budget allocated to each branch. In the tenth column, the target set for each branch can be observed. As can be seen in these columns, all DMUs are involved in the resource allocation and target setting. In the last column, efficiency scores are calculated after resource allocation and target setting. As can be observed in the table, DMUs 6 and 7 were efficient before resource allocation and target setting, and they are still efficient after the allocation. Moreover, DMUs 11 and 20, which were inefficient before allocation, have become efficient after the allocation. According to the last two columns in the table, the efficiency of all DMUs has either increased after resource allocation or remained the same as before allocation. The number of efficient DMUs has increased from 2 to 4. The lowest efficiency score belongs to DMU 14. The highest amount of allocated resources belongs to DMU 9, and as can be seen, it has the highest amount of inputs and outputs among all DMUs. After DMU 9, most of the allocated resources are related to DMUs 6 and 7, respectively, both of which are efficient. And they remain efficient after allocating resources and setting targets.The lowest amount of allocated resources pertains to DMU 21, which has a lower amount of inputs compared with other DMUs. And then the lowest allocation belongs to DMUs 20 and 4, respectively, both of which are inefficient. DMU 11 has had the highest amount of changes in efficiency, the reason for which can be related to the target set for the DMU. DMUs 4 and 10 had the same efficiency before allocation, but their efficiency scores changed after the resource allocation and target setting. The reason for this could be related to their inputs, as DMU 10 has a lower ratio of inputs to overall inputs than DMU 4.Based on the efficiency scores after resource allocation and target setting, the lowest amount of changes in efficiency is related to DMU 17, which is an inefficient DMU and the least targeting has been done for it. Moreover, its received resources are less than other DMUs. The reason for this is that the lowest target was set for this DMU, and it also has received a lower amount of resources than other DMUs, which was itself due to the DMU having a lower amount of inputs and outputs compared with other DMUs. The highest amount of changes is observed in DMU 11, as the highest target was set for this DMU.


## 5. Conclusion

In today’s competitive world, companies and organizations employ scientific methods to make better use of resources and achieve the intended goals. Many researchers have considered fixed resource allocation and targeting in data envelopment analysis science [42–45]. Resource allocation is done for different purposes. Some organizations prefer to allocate resources to prevent changes in the efficiency of DMUs [46–49]. However, the objective of other organizations is to increase efficiency. In this paper, resource allocation and targeting are performed to increase efficiency using a CSW.In all models previously presented for allocating resources and setting targets, the involvement of all DMUs in the resource allocation and target setting was neglected [50–53]. We proposed a model that involves all DMUs in the procedure.The efficiency of the DMUs is improved following the resource allocation and target setting. Here, a lower bound is considered for the allocation of resources and target setting based on the efficiency of each DMU, the share it has in the use of input resources relative to other DMUs, and the outputs it produces relative to other DMUs. This method was compared with other methods provided by common weights by presenting a numerical example. An applied example was also employed with this method.For future research, an upper bound can also be determined. In future research, resource allocation can be performed using common weights with undesired inputs and outputs [54–57]. The resource allocation using goal programming along with fuzzy data can be one of the interesting topics for future researches [58–61].



---

*Source: 2149093-2022-01-12.xml*