AUTHOR COPY. DEA cross-efficiency evaluation under variable returns to scale

Size: px
Start display at page:

Download "AUTHOR COPY. DEA cross-efficiency evaluation under variable returns to scale"

Transcription

1 Journal of the Operational Research Society (2015) 66, Operational Research Society Ltd. All rights reserved /15 DEA cross-efficiency evaluation under variable returns to scale Sungmook Lim 1 * and Joe Zhu 2 1 Dongguk Business School, Dongguk University, Seoul, South Korea; and 2 School of Business, Worcester Polytechnic Institute, Worcester, USA Cross-efficiency evaluation in data envelopment analysis (DEA) has been developed under the assumption of constant returns to scale (CRS), and no valid attempts have been made to apply the cross-efficiency concept to the variable returns to scale (VRS) condition. This is due to the fact that negative VRS cross-efficiency arises for some decision-making units (DMUs). Since there exist many instances that require the use of the VRS DEA model, it is imperative to develop cross-efficiency measures under VRS. We show that negative VRS cross-efficiency is related to free production of outputs. We offer a geometric interpretation of the relationship between the CRS and VRS DEA models. We show that each DMU, via solving the VRS model, seeks an optimal bundle of weights with which its CRS-efficiency score, measured under a translated Cartesian coordinate system, is maximized. We propose that VRS cross-efficiency evaluation should be done via a series of CRS models under translated Cartesian coordinate systems. The current study offers a valid cross-efficiency approach under the assumption of VRS one of the most common assumptions in performance evaluation done by DEA. Journal of the Operational Research Society (2015) 66(3), doi: /jors Published online 12 March 2014 Keywords: data envelopment analysis; cross-efficiency; variable returns to scale (VRS) 1. Introduction Data envelopment analysis (DEA) is a linear programmingbased technique for assessing relative efficiencies of a homogeneous set of decision-making units (DMUs) that consume multiple inputs to produce multiple outputs. It estimates the efficient frontier based on observed values on inputs and outputs, and thereby it distinguishes efficient units and inefficient ones. In its basic form, DEA allows DMUs to choose their own weights on inputs and outputs in the most favourable way with only a limited set of restrictions. With this self-evaluation mechanism as well as too much weight flexibility allowed, it has frequently been observed in many DEA applications that too many DMUs are determined to be efficient and no further distinction can be made among them. Various remedies have been proposed in the literature to address this drawback of DEA: incorporation of weight restrictions, cross-efficiency evaluation, and so on. Among these, cross-efficiency evaluation is addressed in the current paper. Cross-efficiency evaluation adopts peer appraisal in addition to self-appraisal for evaluating DMUs from a more holistic standpoint (see, eg, Sexton et al, 1986; Doyle and Green, 1994). Two major advantages of the cross-efficiency approach are: (1) it provides for an ordering of the DMUs under the concept of peer appraisal and (2) it eliminates unrealistic weighting *Correspondence: Sungmook Lim, Dongguk Business School, Dongguk University, 30, Pildong-ro 1-gil, Jung-gu, Seoul, , South Korea. sungmook@dongguk.edu schemes without requiring a priori information on weight restrictions from application area experts (Anderson et al, 2002). A number of new cross-efficiency models and applications have been proposed in the literature. For example, Liang et al (2008b) develop a game cross-efficiency approach to address the non-uniqueness of cross-efficiency scores. Ramón et al (2011) present peer-restricted cross-efficiency evaluation to reduce the negative influence of non-unique weights in crossefficiency. Cross-efficiency has also been used in various applications, for example, efficiency evaluations of nursing homes (Sexton et al, 1986), R&D project selection (Oral et al, 1991), preference voting (Green et al, 1996), Olympic Games (Wu et al, 2009), and others. Note that cross-efficiency evaluation has been used for DEA models mostly with the constant returns to scale (CRS) assumption, such as the CRS model or CCR model by Charnes, et al (1978). The literature, to the extent of the authors knowledge, has been almost silent on (and has not properly addressed) the issue that cross-efficiency evaluation for inputoriented DEA models with the variable returns to scale (VRS) assumption, such as the input-oriented VRS model or the BCC model of Banker et al (1984), has the problem of negative cross-efficiency for some units. There are many instances where a change in inputs does not result in the same change in outputs that require the use of the VRS DEA model. If DMUs (eg, bank branches) are of various sizes, then the VRS model is more appropriate to use so that a small-sized DMU is not benchmarked against large-sized DMUs. The VRS DEA model is one

2 Sungmook Lim and Joe Zhu DEA cross-efficiency evaluation under VRS 477 of the basic DEA models that is widely used in various DEA applications. Therefore, it is imperative to develop crossefficiency measures under the condition of VRS. Wu et al (2009) propose to add an additional constraint in the VRS modelsothatcross-efficiencies are non-negative. However, such a modification does not properly address the root cause of the negative VRS cross-efficiency problem. In fact, cross-efficiency evaluation is closely related to the issue of incorporation of weight restrictions in the sense that each DMU is evaluated by weights chosen by other DMUs in addition to its own. It is well known that the incorporation of weight restrictions in DEA models may result in their infeasibility or non-positive efficiency scores of some units. Podinovski and Bouzdine-Chameeva (2013) find that these problems arise when weight restrictions induce free production of outputs (ie, positive outputs with zero inputs) in the underlying technology, which is unacceptable from the production theory point of view. Applying the same concept, we also find that the problem of negative cross-efficiency in the inputoriented VRS DEA model arises when a DMU is crossevaluated by a weight vector associated with an efficient frontier that extends to induce free production of outputs in the underlying technology. We claim that such problematic weights are invalid (or unacceptable) for cross-efficiency evaluation and need to be adjusted. To develop a way of resolving the problem of negative crossefficiency in the input-oriented VRS DEA model, we develop a geometric interpretation of the relationship between the VRS and CRS models. We show that every DMU, via solving the VRS model, seeks a translation of the Cartesian coordinate system and an optimal bundle of weights such that its CRSefficiency score, measured under the chosen coordinate system, is maximized. Therefore, VRS cross-efficiency is related to the CRS cross-efficiency measures. Using the fact that no efficient frontier extends to induce free production of outputs in the CRS model, we propose that cross-efficiency evaluation for the VRS model should be done via a series of CRS models under translated Cartesian coordinate systems. The output-oriented VRS DEA model does not suffer from the problem of negative cross-efficiency since their constraints prevent it. Even for the input-oriented VRS DEA model, optimal bundles of weights chosen by DMUs exhibiting increasing returns to scale (IRS) do not give rise to the problem of negative cross-efficiency since the optimal value of the free variable in the VRS multiplier model is always negative for those DMUs (assuming the VRS multiplier model is stated as model (1) in the next section). However, the problem of invalid weights for cross-efficiency evaluation is hidden and still exists for these cases (see Section 4). Consequently, the proposed approach should be applied to these two cases. The current study is the first to offer a valid cross-efficiency approach under the assumption of VRS one of the most common assumptions in performance evaluation done by DEA. We should note here that the proposed approach is based on coordinate system translation. Therefore, the proposed approach appears to have a similar effect with data translation under the VRS model (Ali and Seiford, 1990; Pastor, 1996). However, data translation for all DMUs does not change the shape of the VRS frontier. As a result, the problem of negative VRS cross-efficiency still exists under translation invariance, and data translation cannot resolve the fundamental problem of weight invalidity related to free production of outputs, which will be detailed in the main body of this paper. The paper is organized as follows. The next section is devoted to an illustration of how the problem of negative cross-efficiency arises in the input-oriented VRS model using a simple one-input and one-output example, and shows how it is related to free production of outputs. A geometric interpretation of the relationship between the VRS and the CRS models is then provided to lay a foundation for our approach of crossefficiency evaluation in the VRS DEA model. The proposed crossefficiency evaluation method is adapted to the output-oriented VRS model, followed by an illustrative application to R&D projection selection. Concluding remarks are given at the end. 2. Negative cross-efficiency and free production We assume that there are n DMUs that consume m inputs to produce s outputs. DMU k (k = 1, 2,, n) uses a vector of inputs x k = (x 1k,, x mk ) T R + m to produce a vector of outputs y k = (y 1k,, y sk ) T R + s. The input-oriented VRS model in multiplier form is as follows: max s:t: X s X m X m u r y r0 - ξ v i x ij - Xs v i x i0 ¼ 1 v i ; u r ε 8i; r; ξ free in sign u r y rj + ξ 0; j ¼ 1; ¼ ; n where ε is a positive non-archimedean infinitesimal. When the above model is solved, an efficiency score of DMU 0 and crossefficiencies of the other DMUs (evaluated by DMU 0 ) are obtained together. Specifically, a cross-efficiency of DMU j is given by P s e 0j ¼ u* r y rj - ξ * P m v* i x (2) ij ð1þ where * denotes an optimal solution to the model. Due to the free variable ξ, cross-efficiency calculated by (2) may be negative when ξ > 0, which results in a problematic situation. Averaging e ij over i,weobtainacross-efficiency score of DMU j. The free variable ξ provides an indication of the type of returns to scale (RTS) that prevail at a particular DMU under evaluation. Specifically, IRS (decreasing returns to scale (DRS)) prevails at (x 0, y 0 )ifandonlyifξ* < 0(ξ* > 0) for all

3 478 Journal of the Operational Research Society Vol. 66, No.3 optimal solutions to the VRS model, whereas CRS prevails at (x 0, y 0 ) if and only if ξ* = 0 in any optimal solution (see Banker et al, 2011). It is worth mentioning that the VRS model itself involves cross-efficiency evaluation in its constraints (and the same is true with the CRS model). Model (1) dictates that each DMU seeks an optimal bundle of weights while making crossefficiencies of the other DMUs not exceeding unity. Also note that these cross-efficiencies are measured (in a linearized form within the constraints of model (1)) no matter which type of RTS prevails at cross-evaluated DMUs. In other words, optimal weights chosen by a DMU exhibiting one type of RTS (say IRS) are used to cross-evaluate the other DMUs exhibiting different types of RTS (say CRS or DRS) within model (1). This interpretation provides a justification of the use of crossefficiency evaluation in DEA as a peer-appraisal approach, particularly under the VRS assumption. We now illustrate how the problem of negative crossefficiency arises in the input-oriented VRS model using a simple one-input and one-output example. Suppose the data set in Table 1 is given, which consists of seven DMUs with a single input and a single output. A VRS efficiency score of each DMU along with its optimal weights are also provided in Table 1. Figure 1 plots the data set and the supporting hyperplane associated with an optimal bundle of weights chosen by DMU Table 1 Data and optimal values DMU Input Output v* u* ξ* Efficiency score A 5/3 1 3/ B 2 2 1/2 1/6 2/3 1 C 4 3 1/4 1/8 1/4 5/8 D 3 4 1/3 1/6 1/3 1 E 6 5 1/6 1/6 1/6 2/3 F 5 6 1/5 1/5 1/5 1 G 7 7 1/7 2/7 1 1 G. Hyperplane H G represents an optimal bundle of weights (v*, u*, ξ*) = (1/7, 2/7, 1) for DMU G, with which DMU G attains an efficiency score of unity. Using an input-oriented radial distance measure, cross-efficiencies of DMUs D, E, and F evaluated by DMU G can be determined with reference to hyperplane H G. For instance, a cross-efficiency of DMU E is E 0 E 1 /E 0 E, which is 3/6 = 1/2, a cross-efficiency of DMU D is 1/3, and a cross-efficiency of DMU F is unity. The same results can also be obtained when we use (2) for calculating cross-efficiency: e GE = (10/7 1)/(6/7) = 1/2, e GD = (8/7 1)/(3/7) = 1/3, and e GF = (12/7 1)/(5/7) = 1. While no problems seem to occur in calculating crossefficiencies of these DMUs, a difficulty will be encountered in determining cross-efficiencies of the other DMUs positioned below the horizontal line (labelled x -axis) that intersects the y-axis at O = (0, ξ*/u*) = (0, 7/2). In fact, model (1) forces cross-efficiencies of DMUs A, B, and C to be determined with reference to the negative-input segment of hyperplane H G.For instance, a cross-efficiency of DMU C is C 0 C 1 /C 0 C, which ( 1)/4 = 1/4, and a cross-efficiency of DMU A is A 0 A 1 /A 0 A, which is ( 5)/(5/3) = 3. The negative sign is due to the position of A 1 and C 1 (left to the y-axis).notethatthesame results can be obtained when we use (2): e GC = (6/7 1)/ (4/7) = 1/4, and e GA = (2/7 1)/(5/3/7) = 3. This is problematic because not only are negative cross-efficiencies obtained, but also e GA can diverge to negative infinity as the slope of H G becomes flatter. We claim that this problem is caused by situations where weights chosen by some DMUs are invalid for cross-evaluating other DMUs; an optimal bundle of weights chosen by DMU G is not valid for determining cross-efficiencies of DMUs A, B, and C. To justify this claim, it is worthwhile to note that the efficient frontier associated with the optimal weights chosen by DMU G extends to induce the point O, which represents a free production of outputs in the underlying technology. Furthermore, model (1) forces DMUs A, B, and C to be Figure 1 Cross-efficiency evaluation by DMU G.

4 Sungmook Lim and Joe Zhu DEA cross-efficiency evaluation under VRS 479 cross-evaluated with reference to the invalid part of the extended efficient frontier that emanates from the unacceptable free production point O and points southwest. This implies that some kind of adjustment is required for those invalid weights to be properly used for cross-efficiency evaluation. We proceed to examine the case of negative values of ξ*. Figure 2 shows the supporting hyperplane associated with an optimal bundle of weights chosen by DMU B. Hyperplane H B represents an optimal bundle of weights (v*, u*, ξ*) = (1/2, 1/6, 2/3) for DMU B, with which DMU B attains an efficiency score of unity. Using an input-oriented radial distance measure, cross-efficiencies of the other DMUs evaluated by DMU B can be determined with reference to hyperplane H B. For instance, a cross-efficiency of DMU E is E 0 E 1 /E 0 E, which is 3/6 = 1/2, and a cross-efficiency of DMU G is G 0 G 1 /G 0 G, which is (11/3)/ 7 = 11/21. Note that the same results can be obtained when we use (2) for calculating cross-efficiency: e BE = (5/6 ( 2/3))/(6/2) = 1/2 and e BG = (7/6 ( 2/3))/(7/2) = 11/21. When the optimal value of the free variable, ξ*, is non-positive, the problem of negative crossefficiency does not seem to occur. In other words, when a DMU is cross-evaluated by another DMU exhibiting IRS, it always attains a positive cross-efficiency. Although seemingly unproblematic for this case, our claim made in the above (using the case of DMU G) still applies. According to Podinovski and Bouzdine-Chameeva (2013), a technology is said to allow free production of outputs when it is possible to produce positive outputs with zero inputs. We Figure 2 Cross-efficiency evaluation by DMU A. extend this definition to include the case of negative outputs with zero inputs such as point O in Figure 2. Positive outputs with zero inputs and negative outputs with zero inputs will be referred to as type I and type II of free production of outputs, respectively. Note that the efficient frontier associated with the optimal weights chosen by DMU B extends to induce the point O (in Figure 2), which represents a type II free production of outputs in the underlying technology. Model (1) forces the other DMUs to be cross-evaluated with reference to the invalid efficient frontier (which extends to induce the unacceptable type II free production point O ) for them. 1 On the basis of the above observations, we conclude that cross-efficiency evaluation via the conventional VRS model is not proper regardless of whether the problem of negative cross-efficiency actually arises or not. Therefore, for the VRS DEA model, some significant change of the framework of cross-efficiency evaluation should be developed. We accomplish this based on a geometric view of the relationship between the VRS and CRS models, which will be presented in the next section. 1 Type II free production of outputs can be interpreted as consumption (opposite to production) of outputs without any inputs, and it can be considered as extended free disposability of outputs, which may not be unacceptable. However, we pursue our development assuming it is unacceptable in this paper, which provides a more general framework. In case type II free production of outputs is acceptable; the developed framework of VRS cross-efficiency can be easily simplified to suit the case.

5 480 Journal of the Operational Research Society Vol. 66, No.3 3. DEA and coordinate systems: a geometric link between the VRS and CRS models To lay a foundation for our cross-efficiency evaluation in the VRS DEA model, we develop a geometric interpretation of the VRS model as a series of CRS models under translated Cartesian coordinate systems. Consider the following theorem. Theorem 1 Given any optimal solution (v*, u*, ξ*) to model (1) chosen by a VRS-efficient DMU (denoted DMU 0 ), a CRS-efficiency score of DMU 0, measured under the translated Cartesian coordinate system defined by an adjusted origin O* = ( β 1 ξ*/v * 1,, β m ξ*/v m *, β m +1 ξ*/u*, 1, β m + s ξ*/u*), s is unity, for any β k R + (k = 1, m +, m + s) such that s k = 1 β k = 1. Proof Under the translated Cartesian coordinate system with origin O*, the input-oriented VRS model (3) with the same setofdmusispresentedasfollows: X s max μ r y r0 - β m + rξ * - κ s:t: X m X m u * r v i x ij + β iξ * - Xs v * i + κ 0; j ¼ 1; ¼ ; n v i x i0 + β iξ * ¼ 1 v * i v i ; μ r 0 8i; r; κ free μ r y rj - β m + rξ * u * r ð3þ Consider a solution (v, μ, κ) = (v*/ Γ, u*/ Γ,0) with Γ = 1+ξ* m s k = 1 β k. Note that Γ > 0 since ξ* 1+ r = 1 u * r y r0 > 1and m k = 1 β k 1. Plugging (v*/ Γ, u*/ Γ,0) into the first set of constraints of model (3), we obtain X m v * i Γ x ij + β iξ * - Xs u * r v * i Γ y rj - β m + rξ * u * r! ¼ 1 X m v * i Γ x ij - Xs u * r y rj + ξ * Xm + s β k X m k¼1 ¼ 1 v * i Γ x ij - Xs u * r y rj + ξ! * 0; 8j where the non-negativity is ensured due to the fact that (v*, u*, ξ*) is a feasible solution to model (1) and Γ > 0. If (v*/ Γ, u*/ Γ, 0) is plugged into the second set of constraints of model (3), we obtain X m v * i Γ x i0 + β iξ *! v * ¼ 1 X m v * i i Γ x i0 + ξ * Xm β k ¼ 1 Γ Xm 1 + ξ* k¼1 k¼1 β k! ¼ 1 using the fact that m i = 1 v i *x i 0 = 1. Therefore, (v*/ Γ, u*/γ, 0) is a feasible solution to model (3). Now examine its objective value, which is X s u * r Γ y r0 - β m + rξ *! u * ¼ 1 X s u * r r Γ y r0 - ξ * Xm + s β k k¼m + 1!! ¼ 1 X s u * r Γ y r0 - ξ * + ξ * 1 - Xm + s β k ¼ 1 Γ Xm 1 + ξ* k¼1 β k! ¼ 1 k¼m + 1 Hence, (v*/ Γ, u*/ Γ, 0) is an optimal solution to model (3) with which DMU 0 attains an efficiency score of unity, implying that DMU 0 is VRS-efficientatwhichCRSprevails since κ = 0 in the optimal solution. This leads to the conclusion that DMU 0 is CRS-efficient under the translated coordinate system. Theorem 1 indicates that each DMU, via solving the VRS model, seeks an optimal bundle of weights and free variable value with which its CRS-efficiency score, measured under a translated Cartesian coordinate system, is maximized. In addition, the theorem shows that the location of the adjusted origin of the translated coordinate system is associated with the chosen optimal bundle of weights and free variable value. It should be noted here that the efficient frontier determined by the CRS model does not extend to induce free production of outputs, and thus the CRS model does not suffer from the problem of negative cross-efficiency. Therefore, we expect that the problem of negative cross-efficiency can be effectively resolved by transforming the VRS model into a series of CRS models. Although Theorem 1 deals with only VRS-efficient DMUs, it can be applied implicitly to VRS-inefficient ones as well since inefficient DMUs can choose the same weights with their reference points (projections) on the efficient frontier to maximize their CRS efficiency. However, it should be pointed out that a VRS efficiency score of an inefficient DMU under the original coordinate system may differ from its CRS efficiency score under a translated coordinate system chosen by Theorem 1. On the basis of Theorem 1, the following corollaries provide a link between VRS optimal weights and free production. Corollary 1 The supporting hyperplane of the efficient frontier associated with an optimal bundle of weights in model (1) chosen by a VRS-efficient DMU exhibiting DRS extends to induce type I free production of outputs in the underlying technology. Proof Suppose there is a VRS-efficient DMU at which DRS prevails. Then an optimal value of ξ* chosen by the unit in model (1) will be positive. According to Theorem 1 and its proof, the supporting hyperplane associated with an optimal bundle of weights (v*, u*, ξ*) chosen by the unit in model (1) under the original coordinate system will have

6 Sungmook Lim and Joe Zhu DEA cross-efficiency evaluation under VRS 481 Figure 3 Cross-efficiency evaluation by DMU G under a translated coordinate system. the same slope with the supporting hyperplane associated with an optimal bundle of weights (v*/ Γ, u*/γ) chosen by the same unit in the corresponding CRS model (or the VRS model with the free variable being 0) under a translated coordinate system chosen by Theorem 1. We now consider a special case of Theorem 1 where only output-associated axes are allowed to be translated. The latter hyperplane (associated with (v*/ Γ, u*/ Γ) will go through the adjusted origin O* = (0,,0,β 1 ξ*/u * 1,, β s ξ*/u * s ), which means that the former hyperplane (associated with (v*, u*, ξ*)) will also go through the point O* under the original coordinate system. The point O* represents positive outputs with zero inputs, which is a type I free production of outputs under the original coordinate system. Corollary 2 The supporting hyperplane of the efficient frontier associated with an optimal bundle of weights in model (1) chosen by a VRS-efficient DMU exhibiting IRS extends to induce type II free production of outputs in the underlying technology. Since the proof of this corollary can be given similarly to that of Corollary 1, it is omitted to save space. If a VRS-efficient DMU exhibits CRS (ie, it is CRS-efficient), the corresponding efficient frontier may or may not extend to induce free production of outputs, depending on the sign of the chosen ξ*. However, an optimal solution to model (1) where ξ* = 0 always exists for a CRS-efficient DMU, and we assume that such solution is always chosen. (In applications, once the CRS condition is identified with a DMU, we can use the CRS model to calculate cross-efficiency scores.) Corollaries 1 and 2 suggest that optimal weights chosen by DMUs at which either DRS or IRS prevails are not valid for cross-evaluating other DMUs, and this provides a good rationale for the development of our cross-efficiency evaluation approach in the VRS DEA model, which will be presented in the next section. Before we proceed, we illustrate Theorem 1 and the related corollaries using the example introduced in the previous section For an illustration, we use DMU G, which is VRS-efficient and exhibits DRS under the original coordinate system with origin O, depicted in Figure 1. The supporting hyperplane H G intersects the y-axis at O = (0, ξ*/u*) = (0, 7/2) and the x-axis at O = ( ξ*/v*, 0) = ( 7, 0). Any point on the line O O can be represented by a convex combination of the two extreme points: O* = ( β 1 ξ*/v*, β 2 ξ*/u*) = ( 7β 1, (7/2)β 2 ) where β 1 + β 2 = 1andβ 1, β 2 R +. Observe that the supporting hyperplane H G of the efficient frontier associated with the optimal weights chosen by DMU G extends to induce the point O (in Figure 1), which represents a type I free production of outputs, as indicated by Corollary 1. Therefore, the optimal weights chosen by DMU G at which DRS prevails are not valid for cross-evaluating the other DMUs; for some DMUs such as A, B, and C, this invalidity results in the actually observable realization of negative cross-efficiency. On the other hand, a VRS efficiency score of DMU G, measured under the translated Cartesian coordinate system with an adjusted origin O*, is unity and CRS prevails at DMU G, meaning that DMU G is CRS-efficient under the translated coordinate system, as indicated by Theorem 1. Considering a special case where β 1 = 1andβ 2 = 0, the Cartesian coordinate system defined by the x-axis and the y -axis with the adjusted origin O* = O = ( 7, 0) renders DMU G CRS-efficient. Note that, under the translated coordinate system, the optimal weights (v*/ Γ, u*/γ) = (v*/(1 + ξ*β 1 ), u*/(1 + ξ*β 1 )) = ((1/7)/2, (2/7)/2) = (1/14, 1/7) chosen by DMU G, represented again by H G, are valid for cross-evaluating the other DMUs since they do not induce free production of outputs. For instance, under the translated coordinate system, the coordinates of DMU A are (26/3, 1), and its cross-efficiency using the weights (1/14, 1/7), is e GA = (1/7)/(13/21) = 3/13. This score can also be determined geometrically under the translated coordinate system in Figure 3: e GA ¼ A 3 A 1 /A 3 A ¼ 2/ð26/3Þ ¼3/13.

7 482 Journal of the Operational Research Society Vol. 66, No.3 Table 2 Raw data of 37 R&D projects on 5 outputs and budget R&D project Indirect economic contribution Direct economic contribution Technical contribution Social contribution Scientific contribution Budget Cross-efficiency evaluation in the VRS model We start with the input-oriented VRS model. Recall that Theorem 1 and the corollaries show that optimal weights chosen by a VRS-efficient DMU exhibiting IRS or DRS are not valid for cross-evaluating other DMUs because the corresponding supporting hyperplane of the efficient frontier extends to induce type I or type II free production of outputs. They also imply a geometric relationship between the VRS and CRS models, which can be stated as follows: the VRS model for any DMU can be casted as the CRS model for the same DMU under a translated Cartesian coordinate system. Using the fact that any supporting hyperplane of the efficient frontier does not extend to induce free production of outputs in the CRS model and is thus always valid for cross-efficiency evaluation, we propose that cross-efficiency evaluation for the VRS model should be done via a series of CRS models under translated Cartesian coordinate systems. For an intuitive exposition, let us first examine DMU G in Figure 1. Solving the VRS model for DMU G is equivalent to solving the CRS model for the same unit under a translated Cartesian coordinate system. While there exist numerous choices of an adjusted origin according to Theorem 1 (ie, any point along O O will do), a convenient choice will be either a point on the x-axis or one on the y-axis. However, if the point on the y-axis, O, is chosen for an adjusted origin, some units (DMUs A, B, and C) will have negative outputs under the translated coordinate system, which is not acceptable. This is not the case with the point on the x-axis, O, and therefore it is selected for an adjusted origin. 2 With such translation of the coordinate system 2 We should note that O is not the only choice for O* along O O that does not give rise to the negative-output problem, and resulting cross-efficiencies depend on the choice of O*. However, the choice of an adjusted origin on the x-axis makes it possible to derive a general formula (that does not depend on coefficients β k ) for VRS cross-efficiency as shown in the subsequent paragraphs.

8 Sungmook Lim and Joe Zhu DEA cross-efficiency evaluation under VRS 483 Table 3 Simple efficiency and cross-efficiency scores under VRS and CRS R&D project Proposed VRS crossefficiency score Conventional VRS crossefficiency score VRS simple efficiency score CRS crossefficiency score CRS simple efficiency score Returns to scale DRS DRS IRS DRS DRS DRS DRS DRS DRS DRS DRS IRS IRS DRS DRS IRS CRS DRS DRS IRS DRS DRS DRS DRS IRS DRS DRS IRS DRS DRS DRS IRS IRS IRS CRS DRS DRS applied, it becomes valid for DMU G to cross-evaluate the other DMUs with reference to its supporting hyperplane H G. A similar reasoning can be applied to DMU A in Figure 2. Solving the VRS model for DMU A is equivalent to solving the CRS model for the same unit under a translated Cartesian coordinate system. Again there exist numerous choices of an adjusted origin along O O according to Theorem 1. While a convenient choice will be either a point on the x-axis or one on the y-axis, the point on the x-axis, O, can be selected to ensure consistency. With such translation of the coordinate system applied, it becomes valid for DMU A to cross-evaluate the other DMUs with reference to its supporting hyperplane H A. We now develop a general formula for cross-efficiency evaluation in the input-oriented VRS model. Suppose that DMU 0 cross-evaluates DMU j using its optimal solution (v*, u*, ξ*) to model (1). The translation of the coordinate system is considered defined by an adjusted origin O* = ( β 1 ξ*/v 1 *,, β m ξ*/v m *, 0,, 0) where 0 repeats s times for the outputassociated coordinates, m k =1 β k = 1 and β k R +. Under this I translated coordinate system, a CRS cross-efficiency e 0j of DMU j is determined using the optimal weights (v*/γ, u*/ Γ) chosen by DMU 0 as follows: e I 0j ¼ P s u * r P m v * r Γ x rj + β rξ * v * r P s u* r y rj Γ y rj ¼ P m v* r x rj + β rξ * P s ¼ u* r y rj P m v* r x rj + ξ * v * r ð4þ We use this formula for a VRS cross-efficiency of DMU j (evaluated by DMU 0 ) under the original coordinate system.

9 484 Journal of the Operational Research Society Vol. 66, No.3 Note that the final formula does not involve coefficients β r and has the same form with the inverse of the conventional crossefficiency formula used in the output-oriented VRS model. According to the following proposition, VRS cross-efficiencies calculated by (4) are positive and less than or equal to unity. Proposition 1 0 < e I 0j 1 Proof Optimal weights used in (4) are obtained by solving model (1). The first set of constraints in model (1) can be rewritten as follows: X m v i x ij + ξ Xs u r y rj >0; j ¼ 1; ¼ ; n Therefore, it follows that 0 < e I 0j 1 for all j. Considering that cross-efficiency evaluation in DEA is a I method of peer evaluation, we note that e 0j implements peer evaluation for the VRS DEA model more fully. Note that the VRS DEA model allows a DMU to choose an optimal value ξ* in addition to (v*, u*), where ξ* indicates the RTS type of the DMU. By Theorem 1, we see that an optimal choice (v*, u*, ξ*) of a DMU determines the normal vector (v*, u*) of the supporting hyperplane associated with the efficient frontier (onto which the DMU is projected), as well as the origin of a new Cartesian coordinate system under which the DMU exhibits CRS (ie, the most productive scale size). The new origin can be determined based on the value of ξ*. Note that the CRS DEA model determines only (v*, u*) fixing ξ* = 0. Therefore, cross-efficiency evaluation in the VRS DEA model should properly take into account the role of ξ*. Recall that the role of ξ* is to determine a new Cartesian coordinate system under which the evaluated DMU attains the most productive scale size (ie, CRS efficiency). Let us define the general concept of peer evaluation in DEA as follows: each DMU cross-evaluates other peer DMUs under its own best evaluation environment. Here the best evaluation environment refers to the weights on the input output factors as well as the new coordinate system that are most favourable to the DMU. Under this best evaluation environment, the DMU itself attains the highest efficiency score as well as the most productive scale size. This concept of peer I evaluation can be implemented by e 0j by allowing each DMU to cross-evaluate other peer DMUs under its own best evaluation environment properly represented by all components of the DMU s optimal weights (v*, u*, ξ*). The problem of negative cross-efficiency cannot be observed in the output-oriented VRS model due to its constraints. However, the same weight invalidity problem related to free production of outputs occurs in cross-efficiency evaluation for the output-oriented VRS DEA model as well. This is the case because the input-oriented and output-oriented VRS models have the same efficient frontier structure. We do not investigate this case in detail here because the same logic can be simply applied. Instead, we just provide a formula for crossefficiency evaluation in the output-oriented VRS model as Table 4 follows: e O 0j ¼ Frequency of negative conventional VRS cross-efficiency R&D project exhibiting DRS Number of negative cross-efficiencies P m v* r x rj P s u* r y rj - ξ * (5) We conclude this section by suggesting a formula for crossefficiency score. As pointed out in Section 3, a VRS crossefficiency of a DMU evaluated by the DMU itself, calculated using (4), differs from its simple VRS efficiency score calculated using (2). This means that one DMU will be given n +1 scores: n cross-efficiencies and one simple efficiency. Therefore, a cross-efficiency score of a DMU can be determined by averaging these n cross-efficiencies. 5. An illustrative application to R&D projection selection We apply our proposed VRS cross-efficiency approach to a set of 37 project proposals relating to the Turkish iron and steel industry studied in Oral et al (1991). Each project is characterized by five output measures: direct economic contribution, indirect economic contribution, technological contribution, scientific contribution, and social contribution. The single input is the budget. Table 2 reports the data. Table 3 shows cross-efficiency and simple efficiency scores determined using alternative formulas and RTS assumptions. VRS cross-efficiency scores calculated using our proposed formula (4) and those by the conventional formula (2) are listed in Columns 2 and 3, respectively, and VRS simple efficiency

10 Sungmook Lim and Joe Zhu DEA cross-efficiency evaluation under VRS 485 Table 5 Project selection results Table 6 Standard deviation of cross-efficiency R&D project Proposed VRS cross-efficiency score CRS crossefficiency score Our selection CRS selection Budget Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Budget sum scoresarereportedincolumn4.inaddition,crscross-and simple efficiency scores and RTS classification are also reported in Columns 5, 6, and 7, respectively. It can be observed that some DMUs have negative values of conventional VRS cross-efficiency scores, which is obviously problematic. Specifically, Table 4 shows the frequency of negative conventional VRS cross-efficiency determined using formula (2) by each DMU (as an evaluator) exhibiting DRS. In fact, all DMUs exhibiting DRS yield at least one negative cross-efficiency, which implies that the problem of negative cross-efficiency in the VRS model is significant and never a rare occasion. The RTS classification is obtained using the approach of Seiford and Zhu (1998) to address the problem of possible multiple optimal solutions in model (1). For CRS DMUs, it is likely that ξ* 0. In our current application, once the CRS R&D project Standard deviation of the proposed VRS cross-efficiency Standard deviation of CRS cross-efficiency DMUs are identified, we use the CRS model to calculate crossefficiency scores. Table 5 shows the project selection results based on the proposed VRS cross-efficiency scores and CRS cross-efficiency scores, in which projects are chosen by the decreasing order of cross-efficiency scores until the budget for the programme (given 1000) is exhausted. There are some ranking differences between the two approaches. For example, project 23 is ranked in 5th place by the proposed VRS cross-efficiency, whereas it is ranked in 10th place by the CRS cross-efficiency. Due to these differences, the two approaches choose different sets of projects; Project 17 is included by one approach but excluded by the other, and Projects 32 and 12 are accepted by only one approach. Although there are some ranking differences and different project selections are made by the two approaches (the

11 486 Journal of the Operational Research Society Vol. 66, No.3 proposed VRS cross-efficiency versus the CRS cross-efficiency), the overall results are broadly similar. However, a striking difference between the two approaches can be found by examining the standard deviation of cross-efficiency, which is reported in Table 6. It shows that the CRS cross-efficiencies have much smaller variation, whereas the VRS crossefficiencies have a wide range of values. This is due to the fact that the efficient frontier under the VRS assumption consists of generally far more faces than that under the CRS assumption. This suggests that VRS cross-efficiency is a more effective approach for switching the self-appraisal model of DEA into a peer-appraisal one. Furthermore, the use of DEA in multicriteria decision-making applications such as portfolio selection may require careful attention to be paid to the variability (variance) of cross-efficiencies in addition to their average (cross-efficiency score) to take into account the risk of selected portfolios (see, eg, Stewart, 1996; Salo and Punkka, 2011; Chen and Zhu, 2011; Lim and Zhu, 2013). In this case, VRS crossefficiency evaluation can provide a more comprehensive way of effectively revealing the variability of cross-efficiencies. 6. Concluding remarks We have investigated the problem of negative cross-efficiency in the VRS DEA model and pointed out that the problem is closely related to free production of outputs. To resolve this issue, we have developed a new and valid method of crossefficiency evaluation in the VRS model based on a novel geometric view of the relationship between the VRS and CRS models. Two other alternative approaches can be applied. One is to s incorporate a non-negativity constraint on r = 1 u r y rj ξ, j in model (1), as is suggested by Wu et al (2009). Although this seems a quick fix, it can be easily observed that this fix distorts the feasible region of multipliers. Specifically, for our example, the non-negativity constraints collectively become ξ/u min y j = 1. Note that, for a feasible solution (v, u, ξ), ξ/u denotes the y-intercept of the associated supporting hyperplane. With this distorted feasible region of multipliers, DMUs F and G cannot attain an efficiency score of unity, even though they are VRSefficient. Therefore, this alternative does not correctly address the issue of negative VRS cross-efficiency score. The other approach is simply not to use problematic (or invalid) optimal weights, such as the one chosen by DMU G in the example, for cross-efficiency calculation. In other words, only optimal weights chosen by DMUs exhibiting CRS are used for cross-efficiency evaluation. While this approach is reasonable in that only valid optimal weights are used in the calculation of cross-efficiency, it may cause an unbalanced (or partial) cross-efficiency evaluation. In other words, it prevents a full range of peer evaluation. It may appear that under VRS cross-efficiency, a small-sized DMU can be benchmarked against a large-sized DMU. However, this particular issue should not be a concern under the concept of cross-efficiency. We point out that the basic idea of cross-efficiency is peer evaluation, namely, applying one DMU s perspective (manifested in its optimal bundle of weights) to others. As recently pointed out by Cook et al (2014), although DEA has a strong link to production theory in economics, the tool is also used for benchmarking in operations management, where a set of measures is selected to benchmark the performance of manufacturing and service operations. In the circumstance of benchmarking, the efficient DMUs, as defined by DEA, may not necessarily form a production frontier, but rather lead to a best-practice frontier. Under this general concept, we believe that size or frontier type should not be an issue of concern, and our proposed approach works. VRS and CRS are just two terms used to characterize the shapes of the DEA best practice frontier. Without the concept of RTS, these two different shapes of DEA frontiers still exist; VRS simply offers a tighter envelopment. Furthermore, under multiple inputs and multiple outputs, it is difficult to define what constitutes a small- or large-sized DMU. The idea of crossefficiency is to benchmark DMUs against each other, regardless of their size, whether under CRS or VRS. Under CRS crossefficiency, a large-sized DMU is also benchmarked against a small-sized DMU. If one uses the concept of RTS to characterize the shape of the DEA frontier and to classify DMUs, one can clearly see the difference between CRS and VRS crossefficiency. In general, a set of DMUs can be classified into three groups: IRS, CRS, and DRS. Under the CRS cross-efficiency, all the CRS-efficient facets are applied to IRS and DRS DMUs, while under the VRS cross-efficiency, IRS, CRS, and DRSefficient facets are applied to all DMUs. Since the general concept of cross-efficiency is to look at the performance of a DMU by using other DMUs weights or facets, it is reasonable to apply IRS, CRS, and DRS facets to all DMUs and to generate VRS cross-efficiency. With the approach developed in the current paper, we can now use the cross-efficiency concept under the VRS assumption.wenotethatnon-uniqueness ofcross-efficiency resulting from multiple optimal multipliers is still an issue with the VRS cross-efficiency approach. As in Doyle and Green (1994), we can add a set of secondary goals in the proposed VRS crossefficiency approach. See also Liang et al (2008a) and Lim (2012). We can also develop a game cross-efficiency approach as in Liang et al (2008b). These are possible future research topics. Acknowledgements The authors are grateful to the two anonymous referees for their constructive comments and suggestions on a previous version of this paper. References Ali AI and Seiford LM (1990). Translation invariance in data envelopment analysis. Operations Research Letters 9(6): Anderson TR, Hollingsworth KB and Inman LB (2002). The fixed weighting nature of a cross-evaluation model. Journal of Productivity Analysis 17(3):

12 Sungmook Lim and Joe Zhu DEA cross-efficiency evaluation under VRS 487 Banker RD, Charnes A and Cooper WW (1984). Some models for estimating technical and scale inefficiencies in data envelopment analysis. Management Science 30(9): Banker RD, Cooper WW, Seiford LM and Zhu J (2011). Returns to scale in data envelopment analysis. In Cooper WW, Seiford LM and Zhu J (eds). Handbook on Data Envelopment Analysis. Springer: New York. Charnes A, Cooper WW and Rhodes E (1978). Measuring the efficiency of decision making units. European Journal of Operational Research 2(6): Chen C-M and Zhu J (2011). Efficient resource allocation via efficiency bootstraps: An application to R&D project budgeting. Operations Research 59(3): Cook WD, Tone K and Zhu J (2014). Data envelopment analysis: Prior to choosing a model. Omega 44: 1 4. Doyle J and Green R (1994). Efficiency and cross-efficiency in DEA: Derivations, meanings and uses. Journal of the Operational Research Society 45(5): Green R, Doyle J and Cook WD (1996). Preference voting and project ranking using DEA and cross-evaluation. European Journal of Operational Research 90(3): Liang L, Wu J, Cook WD and Zhu J (2008a). Alternative secondary goals in DEA cross-efficiency evlauation. International Journal of Production Economics 113(2): Liang L, Wu J, Cook WD and Zhu J (2008b). The DEA game crossefficiency model and its Nash equilibrium. Operations Research 56(5): Lim S (2012). Minimax and maximin formulations of cross-efficiency in DEA. Computers & Industrial Engineering 62(3): Lim S and Zhu J (2013). Use of DEA cross-efficiency evaluation in portfolio selection: An application to Korean stock market. European Journal of Operational Research published online 8 December, doi: /j.ejor Oral M, Kettani O and Lang P (1991). A methodology for collective evaluation and selection of industrial R&D projects. Management Science 37(7): Pastor JT (1996). Translation invariance in data envelopment analysis: A generalization. Annals of Operations Research 66(2): Podinovski VV and Bouzdine-Chameeva T (2013). Weight restrictions and free production in data envelopment analysis. Operations Research 61(2): Ramón N, Ruiz JL and Sirvent I (2011). Reducing differences between profiles of weights: A peer-restricted cross-efficiency evaluation. Omega 39(6): Salo A and Punkka A (2011). Ranking intervals and dominance relations for ratio-based efficiency analysis. Management Science 57(1): Seiford LM and Zhu J (1998). On alternative optimal solutions in the estimation of returns to scale in DEA. European Journal of Operational Research 108(1): Sexton TR, Silkman RH and Hogan AJ (1986). Data envelopment analysis: Critique and extensions. New Directions for Program Evaluation 1986(32): Stewart TJ (1996). Relationships between data envelopment analysis and multicriteria decision analysis. Journal of the Operational Research Society 47(5): Wu J, Liang L and Chen Y (2009). DEA game cross-efficiency approach to Olympic rankings. Omega 37(4): Received 14 February 2013; accepted 3 February 2014 after two revisions

Several Modes for Assessment Efficiency Decision Making Unit in Data Envelopment Analysis with Integer Data

Several Modes for Assessment Efficiency Decision Making Unit in Data Envelopment Analysis with Integer Data International Journal of Basic Sciences & Applied Research. Vol., 2 (12), 996-1001, 2013 Available online at http://www.isicenter.org ISSN 2147-3749 2013 Several Modes for Assessment Efficiency Decision

More information

Modified Model for Finding Unique Optimal Solution in Data Envelopment Analysis

Modified Model for Finding Unique Optimal Solution in Data Envelopment Analysis International Mathematical Forum, 3, 2008, no. 29, 1445-1450 Modified Model for Finding Unique Optimal Solution in Data Envelopment Analysis N. Shoja a, F. Hosseinzadeh Lotfi b1, G. R. Jahanshahloo c,

More information

Author's personal copy

Author's personal copy European Journal of Operational Research 202 (2010) 138 142 Contents lists available at ScienceDirect European Journal of Operational Research journal homepage: www.elsevier.com/locate/ejor Production,

More information

Evaluation of Efficiency in DEA Models Using a Common Set of Weights

Evaluation of Efficiency in DEA Models Using a Common Set of Weights Evaluation of in DEA Models Using a Common Set of Weights Shinoy George 1, Sushama C M 2 Assistant Professor, Dept. of Mathematics, Federal Institute of Science and Technology, Angamaly, Kerala, India

More information

THE LINEAR PROGRAMMING APPROACH ON A-P SUPER-EFFICIENCY DATA ENVELOPMENT ANALYSIS MODEL OF INFEASIBILITY OF SOLVING MODEL

THE LINEAR PROGRAMMING APPROACH ON A-P SUPER-EFFICIENCY DATA ENVELOPMENT ANALYSIS MODEL OF INFEASIBILITY OF SOLVING MODEL American Journal of Applied Sciences 11 (4): 601-605, 2014 ISSN: 1546-9239 2014 Science Publication doi:10.3844/aassp.2014.601.605 Published Online 11 (4) 2014 (http://www.thescipub.com/aas.toc) THE LINEAR

More information

Ranking Efficient Units in DEA. by Using TOPSIS Method

Ranking Efficient Units in DEA. by Using TOPSIS Method Applied Mathematical Sciences, Vol. 5, 0, no., 805-85 Ranking Efficient Units in DEA by Using TOPSIS Method F. Hosseinzadeh Lotfi, *, R. Fallahnead and N. Navidi 3 Department of Mathematics, Science and

More information

A New Metric for Scale Elasticity in Data Envelopment Analysis

A New Metric for Scale Elasticity in Data Envelopment Analysis A New Metric for Scale Elasticity in Data Envelopment Analysis M. Hasannasab, I. Roshdi, D. Margaritis, P. Rouse 1 Abstract Robust measurement of scale elasticity (SE) in data envelopment analysis (DEA)

More information

3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times 3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

AM 221: Advanced Optimization Spring 2016

AM 221: Advanced Optimization Spring 2016 AM 221: Advanced Optimization Spring 2016 Prof Yaron Singer Lecture 3 February 1st 1 Overview In our previous lecture we presented fundamental results from convex analysis and in particular the separating

More information

DATA ENVELOPMENT SCENARIO ANALYSIS IN A FORM OF MULTIPLICATIVE MODEL

DATA ENVELOPMENT SCENARIO ANALYSIS IN A FORM OF MULTIPLICATIVE MODEL U.P.B. Sci. Bull., Series D, Vol. 76, Iss. 2, 2014 ISSN 1454-2358 DATA ENVELOPMENT SCENARIO ANALYSIS IN A FORM OF MULTIPLICATIVE MODEL Najmeh Malemohammadi 1, Mahboubeh Farid 2 In this paper a new target

More information

Math 5593 Linear Programming Lecture Notes

Math 5593 Linear Programming Lecture Notes Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................

More information

Some Advanced Topics in Linear Programming

Some Advanced Topics in Linear Programming Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,

More information

Optimization of Multiple Responses Using Data Envelopment Analysis and Response Surface Methodology

Optimization of Multiple Responses Using Data Envelopment Analysis and Response Surface Methodology Tamkang Journal of Science and Engineering, Vol. 13, No., pp. 197 03 (010) 197 Optimization of Multiple Responses Using Data Envelopment Analysis and Response Surface Methodology Chih-Wei Tsai 1 *, Lee-Ing

More information

Chapter 75 Program Design of DEA Based on Windows System

Chapter 75 Program Design of DEA Based on Windows System Chapter 75 Program Design of DEA Based on Windows System Ma Zhanxin, Ma Shengyun and Ma Zhanying Abstract A correct and efficient software system is a basic precondition and important guarantee to realize

More information

On Page Rank. 1 Introduction

On Page Rank. 1 Introduction On Page Rank C. Hoede Faculty of Electrical Engineering, Mathematics and Computer Science University of Twente P.O.Box 217 7500 AE Enschede, The Netherlands Abstract In this paper the concept of page rank

More information

Free Disposal Hull(FDH) Analysis for Efficiency Measurement: An update to dea

Free Disposal Hull(FDH) Analysis for Efficiency Measurement: An update to dea The Stata Journal (yyyy) vv, Number ii, pp. 1 8 Free Disposal Hull(FDH) Analysis for Efficiency Measurement: An update to dea Byoungin Lim Kyoungrok Lee Nextree Soft Co., Ltd. Korea National Defense University

More information

Incompatibility Dimensions and Integration of Atomic Commit Protocols

Incompatibility Dimensions and Integration of Atomic Commit Protocols The International Arab Journal of Information Technology, Vol. 5, No. 4, October 2008 381 Incompatibility Dimensions and Integration of Atomic Commit Protocols Yousef Al-Houmaily Department of Computer

More information

H. W. Kuhn. Bryn Mawr College

H. W. Kuhn. Bryn Mawr College VARIANTS OF THE HUNGARIAN METHOD FOR ASSIGNMENT PROBLEMS' H. W. Kuhn Bryn Mawr College The author presents a geometrical modelwhich illuminates variants of the Hungarian method for the solution of the

More information

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize. Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject

More information

Modeling with Uncertainty Interval Computations Using Fuzzy Sets

Modeling with Uncertainty Interval Computations Using Fuzzy Sets Modeling with Uncertainty Interval Computations Using Fuzzy Sets J. Honda, R. Tankelevich Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO, U.S.A. Abstract A new method

More information

On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games

On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games Bruno Codenotti Daniel Štefankovič Abstract The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix

More information

A two-stage model for ranking DMUs using DEA/AHP

A two-stage model for ranking DMUs using DEA/AHP Available online at http://ijim.srbiau.ac.ir/ Int. J. Industrial Mathematics (ISSN 2008-5621) Vol. 7, No. 2, 2015 Article ID IJIM-00540, 9 pages Research Article A two-stage model for ranking DMUs using

More information

This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane?

This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane? Intersecting Circles This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane? This is a problem that a programmer might have to solve, for example,

More information

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

Discrete Optimization. Lecture Notes 2

Discrete Optimization. Lecture Notes 2 Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The

More information

EXTREME POINTS AND AFFINE EQUIVALENCE

EXTREME POINTS AND AFFINE EQUIVALENCE EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard

More information

A CLASS OF INDIRECT UTILITY FUNCTIONS PREDICTING GIFFEN BEHAVIOUR. P.G. MOFFATT, School of Economics, University of East Anglia, UK.

A CLASS OF INDIRECT UTILITY FUNCTIONS PREDICTING GIFFEN BEHAVIOUR. P.G. MOFFATT, School of Economics, University of East Anglia, UK. A CLASS OF INDIRECT UTILITY FUNCTIONS PREDICTING GIFFEN BEHAVIOUR P.G. MOFFATT, School of Economics, University of East Anglia, UK September 2010 Abstract The problem of recognising Giffen behaviour is

More information

Fuzzy satisfactory evaluation method for covering the ability comparison in the context of DEA efficiency

Fuzzy satisfactory evaluation method for covering the ability comparison in the context of DEA efficiency Control and Cybernetics vol. 35 (2006) No. 2 Fuzzy satisfactory evaluation method for covering the ability comparison in the context of DEA efficiency by Yoshiki Uemura Faculty of Education Mie University,

More information

MA651 Topology. Lecture 4. Topological spaces 2

MA651 Topology. Lecture 4. Topological spaces 2 MA651 Topology. Lecture 4. Topological spaces 2 This text is based on the following books: Linear Algebra and Analysis by Marc Zamansky Topology by James Dugundgji Fundamental concepts of topology by Peter

More information

Crossing Families. Abstract

Crossing Families. Abstract Crossing Families Boris Aronov 1, Paul Erdős 2, Wayne Goddard 3, Daniel J. Kleitman 3, Michael Klugerman 3, János Pach 2,4, Leonard J. Schulman 3 Abstract Given a set of points in the plane, a crossing

More information

Algorithms, Games, and Networks February 21, Lecture 12

Algorithms, Games, and Networks February 21, Lecture 12 Algorithms, Games, and Networks February, 03 Lecturer: Ariel Procaccia Lecture Scribe: Sercan Yıldız Overview In this lecture, we introduce the axiomatic approach to social choice theory. In particular,

More information

Optimal Channel Selection for Cooperative Spectrum Sensing Using Coordination Game

Optimal Channel Selection for Cooperative Spectrum Sensing Using Coordination Game 2012 7th International ICST Conference on Communications and Networking in China (CHINACOM) Optimal Channel Selection for Cooperative Spectrum Sensing Using Coordination Game Yuhua Xu, Zhan Gao and Wei

More information

Graphs that have the feasible bases of a given linear

Graphs that have the feasible bases of a given linear Algorithmic Operations Research Vol.1 (2006) 46 51 Simplex Adjacency Graphs in Linear Optimization Gerard Sierksma and Gert A. Tijssen University of Groningen, Faculty of Economics, P.O. Box 800, 9700

More information

Guidelines for the application of Data Envelopment Analysis to assess evolving software

Guidelines for the application of Data Envelopment Analysis to assess evolving software Short Paper Guidelines for the application of Data Envelopment Analysis to assess evolving software Alexander Chatzigeorgiou Department of Applied Informatics, University of Macedonia 546 Thessaloniki,

More information

The Encoding Complexity of Network Coding

The Encoding Complexity of Network Coding The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network

More information

Camera Calibration Using Line Correspondences

Camera Calibration Using Line Correspondences Camera Calibration Using Line Correspondences Richard I. Hartley G.E. CRD, Schenectady, NY, 12301. Ph: (518)-387-7333 Fax: (518)-387-6845 Email : hartley@crd.ge.com Abstract In this paper, a method of

More information

THE LINEAR MULTIPLE CHOICE KNAPSACK PROBLEM WITH TWO CRITERIA: PROFIT AND EQUITY

THE LINEAR MULTIPLE CHOICE KNAPSACK PROBLEM WITH TWO CRITERIA: PROFIT AND EQUITY MCDM 2006, Chania, Greece, June 19-23, 2006 THE LINEAR MULTIPLE CHOICE KNAPSACK PROBLEM WITH TWO CRITERIA: PROFIT AND EQUITY George Kozanidis Systems Optimization Laboratory Dept. of Mechanical & Industrial

More information

MaxDEA Pro 6.3 Manual

MaxDEA Pro 6.3 Manual MaxDEA Pro 6.3 Manual CHENG Gang, QIAN Zhenhua Email: MaxDEA@qq.com http://www.maxdea.cn Beijing Realworld Research and Consultation Company Ltd Contents 1 Overview... 1 Features of MaxDEA Pro... 1 DEA

More information

On the number of distinct directions of planes determined by n points in R 3

On the number of distinct directions of planes determined by n points in R 3 On the number of distinct directions of planes determined by n points in R 3 Rom Pinchasi August 27, 2007 Abstract We show that any set of n points in R 3, that is not contained in a plane, determines

More information

Linear programming II João Carlos Lourenço

Linear programming II João Carlos Lourenço Decision Support Models Linear programming II João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research,

More information

LP-Modelling. dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven. January 30, 2008

LP-Modelling. dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven. January 30, 2008 LP-Modelling dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven January 30, 2008 1 Linear and Integer Programming After a brief check with the backgrounds of the participants it seems that the following

More information

General properties of staircase and convex dual feasible functions

General properties of staircase and convex dual feasible functions General properties of staircase and convex dual feasible functions JÜRGEN RIETZ, CLÁUDIO ALVES, J. M. VALÉRIO de CARVALHO Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia

More information

Lower bounds and recursive methods for the problem of adjudicating conflicting claims

Lower bounds and recursive methods for the problem of adjudicating conflicting claims Lower bounds and recursive methods for the problem of adjudicating conflicting claims Diego Dominguez University of Rochester March 31, 006 Abstract For the problem of adjudicating conflicting claims,

More information

LEAST DISTANCE BASED INEFFICIENCY MEASURES ON THE PARETO-EFFICIENT FRONTIER IN DEA

LEAST DISTANCE BASED INEFFICIENCY MEASURES ON THE PARETO-EFFICIENT FRONTIER IN DEA Journal of the Operations Research Society of Japan Vol. 55, No. 1, March 2012, pp. 73 91 c The Operations Research Society of Japan LEAST DISTANCE BASED INEFFICIENCY MEASURES ON THE PARETO-EFFICIENT FRONTIER

More information

8.B. The result of Regiomontanus on tetrahedra

8.B. The result of Regiomontanus on tetrahedra 8.B. The result of Regiomontanus on tetrahedra We have already mentioned that Plato s theory that the five regular polyhedra represent the fundamental elements of nature, and in supplement (3.D) to the

More information

5 The Theory of the Simplex Method

5 The Theory of the Simplex Method 5 The Theory of the Simplex Method Chapter 4 introduced the basic mechanics of the simplex method. Now we shall delve a little more deeply into this algorithm by examining some of its underlying theory.

More information

Recognizing Interval Bigraphs by Forbidden Patterns

Recognizing Interval Bigraphs by Forbidden Patterns Recognizing Interval Bigraphs by Forbidden Patterns Arash Rafiey Simon Fraser University, Vancouver, Canada, and Indiana State University, IN, USA arashr@sfu.ca, arash.rafiey@indstate.edu Abstract Let

More information

c 2004 Society for Industrial and Applied Mathematics

c 2004 Society for Industrial and Applied Mathematics SIAM J. MATRIX ANAL. APPL. Vol. 26, No. 2, pp. 390 399 c 2004 Society for Industrial and Applied Mathematics HERMITIAN MATRICES, EIGENVALUE MULTIPLICITIES, AND EIGENVECTOR COMPONENTS CHARLES R. JOHNSON

More information

6. Lecture notes on matroid intersection

6. Lecture notes on matroid intersection Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm

More information

Bounds on the signed domination number of a graph.

Bounds on the signed domination number of a graph. Bounds on the signed domination number of a graph. Ruth Haas and Thomas B. Wexler September 7, 00 Abstract Let G = (V, E) be a simple graph on vertex set V and define a function f : V {, }. The function

More information

Winning Positions in Simplicial Nim

Winning Positions in Simplicial Nim Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:

More information

Solutions of Stochastic Coalitional Games

Solutions of Stochastic Coalitional Games Applied Mathematical Sciences, Vol. 8, 2014, no. 169, 8443-8450 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410881 Solutions of Stochastic Coalitional Games Xeniya Grigorieva St.Petersburg

More information

Journal of Asian Scientific Research FEATURES COMPOSITION FOR PROFICIENT AND REAL TIME RETRIEVAL IN CBIR SYSTEM. Tohid Sedghi

Journal of Asian Scientific Research FEATURES COMPOSITION FOR PROFICIENT AND REAL TIME RETRIEVAL IN CBIR SYSTEM. Tohid Sedghi Journal of Asian Scientific Research, 013, 3(1):68-74 Journal of Asian Scientific Research journal homepage: http://aessweb.com/journal-detail.php?id=5003 FEATURES COMPOSTON FOR PROFCENT AND REAL TME RETREVAL

More information

Test designs for evaluating the effectiveness of mail packs Received: 30th November, 2001

Test designs for evaluating the effectiveness of mail packs Received: 30th November, 2001 Test designs for evaluating the effectiveness of mail packs Received: 30th November, 2001 Leonard Paas previously worked as a senior consultant at the Database Marketing Centre of Postbank. He worked on

More information

Foundation Level Learning Targets Version 2.2

Foundation Level Learning Targets Version 2.2 Milwaukee Public Schools High School Mathematics Foundation Level Learning Targets Version 2.2 Note: Non-Negotiable Learning Targets and descriptors are identified with an *. The specifications aligned

More information

Cost Effectiveness of Programming Methods A Replication and Extension

Cost Effectiveness of Programming Methods A Replication and Extension A Replication and Extension Completed Research Paper Wenying Sun Computer Information Sciences Washburn University nan.sun@washburn.edu Hee Seok Nam Mathematics and Statistics Washburn University heeseok.nam@washburn.edu

More information

Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

More information

IDENTIFICATION AND ELIMINATION OF INTERIOR POINTS FOR THE MINIMUM ENCLOSING BALL PROBLEM

IDENTIFICATION AND ELIMINATION OF INTERIOR POINTS FOR THE MINIMUM ENCLOSING BALL PROBLEM IDENTIFICATION AND ELIMINATION OF INTERIOR POINTS FOR THE MINIMUM ENCLOSING BALL PROBLEM S. DAMLA AHIPAŞAOĞLU AND E. ALPER Yıldırım Abstract. Given A := {a 1,..., a m } R n, we consider the problem of

More information

Bayesian Estimation for Skew Normal Distributions Using Data Augmentation

Bayesian Estimation for Skew Normal Distributions Using Data Augmentation The Korean Communications in Statistics Vol. 12 No. 2, 2005 pp. 323-333 Bayesian Estimation for Skew Normal Distributions Using Data Augmentation Hea-Jung Kim 1) Abstract In this paper, we develop a MCMC

More information

6. Concluding Remarks

6. Concluding Remarks [8] K. J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, Tech. Rept., Department of Computer Science, University of Illinois, Urbana-Champaign, August 1980, also

More information

Using Genetic Algorithms for Maximizing Technical Efficiency in Data Envelopment Analysis

Using Genetic Algorithms for Maximizing Technical Efficiency in Data Envelopment Analysis Procedia Computer Science Volume 51, 2015, Pages 374 383 ICCS 2015 International Conference On Computational Science Using Genetic Algorithms for Maximizing Technical Efficiency in Data Envelopment Analysis

More information

Applied Lagrange Duality for Constrained Optimization

Applied Lagrange Duality for Constrained Optimization Applied Lagrange Duality for Constrained Optimization Robert M. Freund February 10, 2004 c 2004 Massachusetts Institute of Technology. 1 1 Overview The Practical Importance of Duality Review of Convexity

More information

EVALUATION OF CLASSIFICATION ABILITY OF THE PARAMETERS CHARACTERIZING STEREOMETRIC PROPERTIES OF TECHNICAL SURFACES 1.

EVALUATION OF CLASSIFICATION ABILITY OF THE PARAMETERS CHARACTERIZING STEREOMETRIC PROPERTIES OF TECHNICAL SURFACES 1. Journal of Machine Engineering, Vol. 16, No. 2, 216 Received: 7 March 216 / Accepted: 5 April 216 / Published online: 2 June 216 surface geometric structure, parameter classification ability Wojciech KACALAK

More information

Research Article Data Visualization Using Rational Trigonometric Spline

Research Article Data Visualization Using Rational Trigonometric Spline Applied Mathematics Volume Article ID 97 pages http://dx.doi.org/.//97 Research Article Data Visualization Using Rational Trigonometric Spline Uzma Bashir and Jamaludin Md. Ali School of Mathematical Sciences

More information

Toru Kikuchi Kobe University. Abstract

Toru Kikuchi Kobe University. Abstract Network externalities as a source of comparative advantage Toru Kikuchi Kobe University Abstract This note examines how the network externalities of communications activities and trading opportunities

More information

Two Comments on the Principle of Revealed Preference

Two Comments on the Principle of Revealed Preference Two Comments on the Principle of Revealed Preference Ariel Rubinstein School of Economics, Tel Aviv University and Department of Economics, New York University and Yuval Salant Graduate School of Business,

More information

AN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE 1.INTRODUCTION

AN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE 1.INTRODUCTION Mathematical and Computational Applications, Vol. 16, No. 3, pp. 588-597, 2011. Association for Scientific Research AN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE

More information

A note on isolate domination

A note on isolate domination Electronic Journal of Graph Theory and Applications 4 (1) (016), 94 100 A note on isolate domination I. Sahul Hamid a, S. Balamurugan b, A. Navaneethakrishnan c a Department of Mathematics, The Madura

More information

Chordal graphs and the characteristic polynomial

Chordal graphs and the characteristic polynomial Discrete Mathematics 262 (2003) 211 219 www.elsevier.com/locate/disc Chordal graphs and the characteristic polynomial Elizabeth W. McMahon ;1, Beth A. Shimkus 2, Jessica A. Wolfson 3 Department of Mathematics,

More information

MATH3016: OPTIMIZATION

MATH3016: OPTIMIZATION MATH3016: OPTIMIZATION Lecturer: Dr Huifu Xu School of Mathematics University of Southampton Highfield SO17 1BJ Southampton Email: h.xu@soton.ac.uk 1 Introduction What is optimization? Optimization is

More information

Spanning trees and orientations of graphs

Spanning trees and orientations of graphs Journal of Combinatorics Volume 1, Number 2, 101 111, 2010 Spanning trees and orientations of graphs Carsten Thomassen A conjecture of Merino and Welsh says that the number of spanning trees τ(g) of a

More information

A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY

A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,

More information

OPTIMIZATION, OPTIMAL DESIGN AND DE NOVO PROGRAMMING: DISCUSSION NOTES

OPTIMIZATION, OPTIMAL DESIGN AND DE NOVO PROGRAMMING: DISCUSSION NOTES OPTIMIZATION, OPTIMAL DESIGN AND DE NOVO PROGRAMMING: DISCUSSION NOTES MILAN ZELENY Introduction Fordham University, New York, USA mzeleny@fordham.edu Many older texts, with titles like Globally Optimal

More information

FUTURE communication networks are expected to support

FUTURE communication networks are expected to support 1146 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 13, NO 5, OCTOBER 2005 A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast Ariel Orda, Senior Member, IEEE, and Alexander Sprintson,

More information

PANCYCLICITY WHEN EACH CYCLE CONTAINS k CHORDS

PANCYCLICITY WHEN EACH CYCLE CONTAINS k CHORDS Discussiones Mathematicae Graph Theory xx (xxxx) 1 13 doi:10.7151/dmgt.2106 PANCYCLICITY WHEN EACH CYCLE CONTAINS k CHORDS Vladislav Taranchuk Department of Mathematics and Statistics California State

More information

2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006

2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,

More information

A response to the critiques of DEA by Dmitruk and Koshevoy, and Bol

A response to the critiques of DEA by Dmitruk and Koshevoy, and Bol J Prod Anal (2008) 29:15 21 DOI 10.1007/s11-007-0061-7 A response to the critiques of DEA by Dmitruk and Koshevoy, and Bol W. W. Cooper Æ Z. Huang Æ S. Li Æ J. Zhu Published online: 1 August 2007 Ó Springer

More information

Acyclic fuzzy preferences and the Orlovsky choice function: A note. Denis BOUYSSOU

Acyclic fuzzy preferences and the Orlovsky choice function: A note. Denis BOUYSSOU Acyclic fuzzy preferences and the Orlovsky choice function: A note Denis BOUYSSOU Abstract This note corrects and extends a recent axiomatic characterization of the Orlovsky choice function for a particular

More information

Michał Dębski. Uniwersytet Warszawski. On a topological relaxation of a conjecture of Erdős and Nešetřil

Michał Dębski. Uniwersytet Warszawski. On a topological relaxation of a conjecture of Erdős and Nešetřil Michał Dębski Uniwersytet Warszawski On a topological relaxation of a conjecture of Erdős and Nešetřil Praca semestralna nr 3 (semestr letni 2012/13) Opiekun pracy: Tomasz Łuczak On a topological relaxation

More information

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY ALGEBRAIC METHODS IN LOGIC AND IN COMPUTER SCIENCE BANACH CENTER PUBLICATIONS, VOLUME 28 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1993 ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING

More information

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions. THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of

More information

Part 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm

Part 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm In the name of God Part 4. 4.1. Dantzig-Wolf Decomposition Algorithm Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction Real world linear programs having thousands of rows and columns.

More information

2 The Fractional Chromatic Gap

2 The Fractional Chromatic Gap C 1 11 2 The Fractional Chromatic Gap As previously noted, for any finite graph. This result follows from the strong duality of linear programs. Since there is no such duality result for infinite linear

More information

Some Notes on Geometric Interpretation of Holding-Free Solution for Urban Intersection Model

Some Notes on Geometric Interpretation of Holding-Free Solution for Urban Intersection Model Some Notes on Geometric Interpretation of Holding-Free Solution for Urban Intersection Model Yen-Hsiang TanChen a,1 Abstract Feb, 2017 Conventionally, methods to solve macroscopic node model are discussed

More information

Lecture 2 September 3

Lecture 2 September 3 EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give

More information

Visual Formula, Important Graphs, Inequalities, and Other Things

Visual Formula, Important Graphs, Inequalities, and Other Things flynt_1598632914_ch10, 4/8/6, 12:3191 chapter 10 Visual Formula, Important Graphs, Inequalities, and Other Things The activities this chapter covers allow you to use Visual Formula to work with many of

More information

ON SOME METHODS OF CONSTRUCTION OF BLOCK DESIGNS

ON SOME METHODS OF CONSTRUCTION OF BLOCK DESIGNS ON SOME METHODS OF CONSTRUCTION OF BLOCK DESIGNS NURNABI MEHERUL ALAM M.Sc. (Agricultural Statistics), Roll No. I.A.S.R.I, Library Avenue, New Delhi- Chairperson: Dr. P.K. Batra Abstract: Block designs

More information

A-SSE.1.1, A-SSE.1.2-

A-SSE.1.1, A-SSE.1.2- Putnam County Schools Curriculum Map Algebra 1 2016-2017 Module: 4 Quadratic and Exponential Functions Instructional Window: January 9-February 17 Assessment Window: February 20 March 3 MAFS Standards

More information

by conservation of flow, hence the cancelation. Similarly, we have

by conservation of flow, hence the cancelation. Similarly, we have Chapter 13: Network Flows and Applications Network: directed graph with source S and target T. Non-negative edge weights represent capacities. Assume no edges into S or out of T. (If necessary, we can

More information

An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm

An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm Henan Zhao and Rizos Sakellariou Department of Computer Science, University of Manchester,

More information

"On Geometric Programming Problems Having Negative Degree of Difficulty"

On Geometric Programming Problems Having Negative Degree of Difficulty "On Geometric Programming Problems Having Negative Degree of Difficulty" by DENNIS L. BRICKER Dept. of Industrial and Management Engineering The University of Iowa, Iowa City, IA 52242 USA JAE CHUL CHOI

More information

EXERCISES SHORTEST PATHS: APPLICATIONS, OPTIMIZATION, VARIATIONS, AND SOLVING THE CONSTRAINED SHORTEST PATH PROBLEM. 1 Applications and Modelling

EXERCISES SHORTEST PATHS: APPLICATIONS, OPTIMIZATION, VARIATIONS, AND SOLVING THE CONSTRAINED SHORTEST PATH PROBLEM. 1 Applications and Modelling SHORTEST PATHS: APPLICATIONS, OPTIMIZATION, VARIATIONS, AND SOLVING THE CONSTRAINED SHORTEST PATH PROBLEM EXERCISES Prepared by Natashia Boland 1 and Irina Dumitrescu 2 1 Applications and Modelling 1.1

More information

The Ohio State University Columbus, Ohio, USA Universidad Autónoma de Nuevo León San Nicolás de los Garza, Nuevo León, México, 66450

The Ohio State University Columbus, Ohio, USA Universidad Autónoma de Nuevo León San Nicolás de los Garza, Nuevo León, México, 66450 Optimization and Analysis of Variability in High Precision Injection Molding Carlos E. Castro 1, Blaine Lilly 1, José M. Castro 1, and Mauricio Cabrera Ríos 2 1 Department of Industrial, Welding & Systems

More information

Prioritizing the Links on the Homepage: Evidence from a University Website Lian-lian SONG 1,a* and Geoffrey TSO 2,b

Prioritizing the Links on the Homepage: Evidence from a University Website Lian-lian SONG 1,a* and Geoffrey TSO 2,b 2017 3rd International Conference on E-commerce and Contemporary Economic Development (ECED 2017) ISBN: 978-1-60595-446-2 Prioritizing the Links on the Homepage: Evidence from a University Website Lian-lian

More information

Incompatibility Dimensions and Integration of Atomic Commit Protocols

Incompatibility Dimensions and Integration of Atomic Commit Protocols Preprint Incompatibility Dimensions and Integration of Atomic Protocols, Yousef J. Al-Houmaily, International Arab Journal of Information Technology, Vol. 5, No. 4, pp. 381-392, October 2008. Incompatibility

More information

THE TOPOLOGICAL APPROACH TO SOCIAL CHOICE

THE TOPOLOGICAL APPROACH TO SOCIAL CHOICE THE TOPOLOGICAL APPROACH TO SOCIAL CHOICE WEI HAN CHIA Abstract. Social Choice Theory is a field in economics which studies the possibility of fair aggregation maps of choices. One particularly famous

More information

Section A1: Gradients of straight lines

Section A1: Gradients of straight lines Time To study this unit will take you about 10 hours. Trying out and evaluating the activities with your pupils in the class will be spread over the weeks you have planned to cover the topic. 31 Section

More information

Discharging and reducible configurations

Discharging and reducible configurations Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs

More information