A response to the critiques of DEA by Dmitruk and Koshevoy, and Bol
|
|
- Brendan Kelley
- 5 years ago
- Views:
Transcription
1 J Prod Anal (2008) 29:15 21 DOI /s 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 Science+Business Media, LLC 2007 Abstract We here critique the articles by Dmitruk & Koshevoy (1991, J Econ Theory 55: ) and by Bol (1986, J Econ Theory 38: ) by showing how to solve the examples they erected to show the non-existence of functions for evaluating performance efficiencies in DEA. We also show that functions satisfying these criteria and other important criteria as well were already available prior to the publications of D&K and by Bol and have since been greatly extended to increase the power and scope of DEA. Keywords Performance evaluations Efficiency measures Effectiveness measures 1 Introduction In the course of reviewing one of our recent papers, a referee called our attention to the article in the Journal of W. W. Cooper (&) Department of Information, Risk, and Operations Management (IROM), The University of Texas at Austin, 1 University Station B6500, Austin, TX , USA cooperw@mail.utexas.edu Z. Huang S. Li School of Business, Adelphi University, Garden City, Long Island, NY 11530, USA Z. Huang huang@adelphi.edu S. Li susan@adelphi.edu J. Zhu Department of Management, Worcester Polytechnic Institute, Worcester, MA 01609, USA jzhu@wpi.edu Economic Theory by Dmitruk and Koshevoy (1991), the reading of which called our attention to the article by G. Bol (1986). As the referee indicated, in the economics literature these papers are apparently regarded as landmark contributions dealing with limitations of Data Envelopment Analysis (DEA). These articles by D&K and Bol are now outdated and, in fact, were already outdated at time of publication. We here counter the examples of non-existence that they supply and locate a major source of the difficulties that D&K and Bol identified in the fact that the technical evaluation measures considered by D&K and by Bol, as well as others in the literature they cite, are not complete. 1 That is, in the sense of Cooper et al. (1999), the measures are incomplete because they fail to reflect all of the inefficiencies that a model can identify. 2 Debreu-Farrell models and measures We start with the following technical efficiency criteria as specified in D&K which a function, F(x), is to satisfy if it is to provide a satisfactory measure, (F1) for all x 2 L, F(x) 1; (F2) if x 2 Eff L, then F(x) ¼ 1; (F3) for all x 2 L andk > 0 then FðkxÞ ¼ð1=kÞF(x); (F4) if x 0 x 00 ; x 0 6¼ x 00 ; then Fðx 0 Þ > Fðx 0 Þ; ðaþ 1 D&K (but not Bol), following Färe and Lovell (1978), explicitly assume free disposal, which means they disregard non-zero slacks as sources of inefficiency and this makes the resulting measures incomplete.
2 16 J Prod Anal (2008) 29:15 21 where x is a vector of inputs in L, the production possibility set. 2 Partly because F(2) and F(4) imply F(1), D&K replace (F2) with, ðf2 0 Þ for any x 2 L, F(x) ¼ 1, x 2 Eff L, where, we might note, the above criteria are a modification of the requirements specified for efficiency by Färe and Lovell (1978, p. 157), to which D&K are responding. The following model from Färe and Lovell (1978) see also Färe et al. (1985) can help us to understand the concerns of F&L as well as D&K, hx io ¼ Pn minh x ij k i þ s i i ¼ 1;...; m y ro ¼ Pn y rj k i s þ r r ¼ 1;...; s 0 k j ; s i ; s þ r 8i,j,r. ð1þ Here x ij, y rj respectively refer to the input amounts utilized and the output amounts produced, as determined from observed data for DMU j (the j th Decision Making Unit), j = 1,..., n. The x io and y ro refer to the inputs and outputs of DMU o, the DMU j that is to be evaluated relative to the entire collection of DMU j, j = 1,..., n, including DMU o. For the present we assume that these values are all positive, and thus follow D&K and Bol who assume this implicitly with the examples they use to show non-existence. This positivity assumption implies that solutions always exist to (1) with values of min h = h * 1 as prescribed in (F1) of A. We have here used the notation commonly employed in the DEA literature where (1) is referred to as the Farrell model (or measure). We shall, however, refer to it as the Debreu-Farrell model to reflect the fact, as cited by Farrell (1957), that Debreu (1951) is the source for his developments. This leads to the following. Definition 1 Debreu-Farrell Efficiency: DMU o is efficient if min h = h * = 1 and it is inefficient if h * < 1 with (1 h * )x io representing the amount of inefficiency in each of the i = 1,..., m inputs. As we shall see, this falls short of what is required to fulfill the following, Definition 2 Pareto-Koopmans Efficiency is attained by DMU o iff the evidence shows that it is not possible to improve any input or output without worsening some other input or output. The latter is the definition generally used in the DEA literature. We refer to it as P-K efficiency and note that it is the ordinary definition of technical efficiency that is implicitly used by D&K and reflected in (F2 ). We first turn to FðxÞ ¼ DF hðxþ ¼h, where h * is optimal for (1), as a choice of the measure of efficiency that is optimized. Commonly referred to as a radial measure, it is the value of the ratio of two measures of distance: (a) the distance on a ray from the origin to the point with coordinates that represent the performance of the DMU o being evaluated and (b) the distance from the origin to the point where this ray intersects the frontier. See Cooper et al. (2006a, Submitted) for a detailed development showing that any p measure may be used to form this ratio. 3 FDH and CCR (Charnes et al. 1978) models and measures Figure 1 is used by D&K to show that the desired function does not always exist and hence exemplifies their theorems. In this figure the production possibility set defined by L consists of all points on and to the northeast of the isoquant (e.g., the unit isoquant in which output is equal to unity) represented by the solid lines. Here Eff L [in the D&K notation] consists [only] of points a, d and the [open] interval (b, c) so that all other points evaluated by this section of the isoquant are not efficient. This figure illustrates the non existence arguments by D&K (p. 124). To start our counter analysis we note that a straightforward use of (1) in the manner usually used in DEA will result in a showing that only a and d are efficient so all other points, including the interval (b to c), have values of h * < 1 and hence are inefficient. Measured in this manner, however, evaluations can be effected on a line connecting a and d and hence are outside the production possibility set. x 2 a=(1,3) b=(2,3) p=(3,3) c=(3,2) d=(3,1) 2 See Charnes et al. (1985) for a simple axiomatic formulation that lies in the intersection of all of the commonly used axioms to characterize such production possibility sets. Fig. 1 Dmitruk and Koshevoy example x 1
3 J Prod Anal (2008) 29: To counter the D&K argument we adjoin the following bivalency condition to (1), k j 2 f0; 1g; Xn k j ¼ 1: ð2þ We are here using concepts from the FDH (Free Disposal Hull) method as introduced into DEA by H. Tulkens and his associates at CORE (Center for Operations Research and Econometrics) at the University of Louvain. See e.g., Tulkens (1993) and Deprins et al. (1984). For illustrative clarity we now use the numerical coordinates we have introduced into the portrayal of Fig. 1 and employ these values to represent the following function and its domain, 8 ðiþ For 1x 1 2;x 2 3useð1Þand ð2þ: >< ðiiþ For x 1 2;x 2 2 use ð1þ: Fx ðþ¼ Only use isoquant from b to c. >: ðiiiþ For x 1 3;x 2 1 use ð1þ and ð2þ; ð3þ where the range is 0 h * 1 for optimal h, as in (1), when the data are positive. We then define our measure of efficiency with h ¼ minff i ðxþ; F ii ðxþ; F iii ðxþg: ð4þ This will resolve ambiguities that can arise when the point being evaluated lies in an intersection or a boundary associated with the different regions delineated in (3). Cf. p for an example. We start our analysis by evaluating the point p = (3,3) (which we have added to D&K in Fig. 1) for which we use (ii) to obtain the following adaptation from (1), min h 2k b þ 3k c þ 3k p þ s 1 ¼ 3h 3k b þ 2k c þ 3k p þ s 2 ¼ 3h k b þ k c þ k p s þ ¼ 1 k b ; k c ; k p ; s 1 ; s 2 ; sþ 0: Here the third constraint reflects the unit output that is associated with the isoquant represented by the solid lines in Fig. 1. This problem has as its solution h ¼ 0:833þ; k b ¼ k c ¼ 0:5: Hence, as required, h * = < 1 shows that the DMU associated with p is not efficient. An immediate consequence of this solution is that the point represented by 2k b þ 3k c ¼ 3h ¼ 2:5 3k b þ 2k c ¼ 3h ¼ 2:5 is efficient with value ^h ¼ 1 and it satisfies P-K efficiency with both slacks zero. The same is true for all points in this interval from b to c. Also h * < 1 for points in the interior of the production possibility set that are evaluated by the isoquant from a to b. Therefore (F1) and (F2) of (A) are satisfied in this interval. The same results are obtained from (1) and (2) for every other point in Fig. 1. That is, we will have h * = 1for points on the frontier indicated by the solid line and h * < 1 for points in the interior of the production possibility set. Hence (F1) and (F2) in (A) are always satisfied. Turning to (F3) in (A) we utilize the ratio form presented in Charnes et al. (1978), min zx; ð yþ ¼ u ry P ro m v ix io u ry P ro m v ix io 1; j ¼ 1;...; n u r ; v i 0 8r; i: t Xm We then choose a variable t such that v i x io ¼ 1; ð5þ ð6þ which implies t >0. 3 Multiplying all numerators and denominators by this t does not change the value of any ratio. Hence setting l r ¼ tu r ; m ¼ tv i ; r ¼ 1;...; s i ¼ 1;...; m we replace (5) by max z(y) ¼ Ps m i x io ¼ 1 l r y ro l r y rj Pm m i x ij 0; l r ; m i 0 8r; i: j ¼ 1;...; n ð7þ 3 We are here using the development on pp in Cooper et al. (2006b) but the basic development is taken from fractional programming as first presented in Charnes and Cooper (1962). See Schaible (1994) for a survey of the 900+ papers on fractional programming and its extensions since publication of this paper by Charnes and Cooper. See Bradley and Frey (1974) for fractional programming formulations that extend the Cobb-Douglas (and related homogeneous functions) that are frequently used in economics.
4 18 J Prod Anal (2008) 29:15 21 We therefore relate (5) to (7) via u r y ro v i x ¼ Xs l r y ro ð8þ io where * represents an optimal value. However, (7) is the dual ( multiplier ) model to (1), so l r y ro m i x io ¼ h ðxþ: ð9þ Thus, F(x) is homogenous of degree minus one as stipulated in F(3), and multiplication of the x io by any constant, k >0,i = 1,...,m, gives l r y ro ð Þ ¼ 1 k h ð10þ m i kx io as in (F3). This is to say that if h * (x) is the efficiency measure associated with input vector x then altering all its component, x io, by the same k > 0 should alter the value of the efficiency measure to k 1 h * (x). See the discussion of the Russell measure on p. 157 of Färe and Lovell (1978). In any case, we have now satisfied (F3) in Satisfaction of (10) is not simply a mathematical coincidence. For a rationale embodying the result in (9) we can interpret (5) as the real problem of interest so that (7) and (1) are simply parts of the algorithm used to solve this nonlinear (and non convex) problem. (See, for instance, Cooper et al. (2007) where this approach is used to obtain an aggregate measure of efficiency from the efficiency scores of the individual DMUs). This interpretation is analogous to the manner in which simplex tableaus represent solutions to problems en route to solving the problem of interest with the simplex method. See the discussion of algorithmic completion of a model in Charnes and Cooper (1965). D&K (p. 124) refer to F(x) as having a discontinuity at point b. However, this is clearly not the case since h * =1at all points on the frontier, as has now been shown. D&K therefore probably mean that the efficiency measure should change to a value less than unity at b. This is accomplished, as in Charnes et al. (1978), 4 by replacing the objective in (1) with min zx; ð yþ ¼ h e X s s þ r þ Xm s i 4 This is the same year as Färe and Lovell (1978).! ð11þ where the s þ r ; s i 0 are the output and input slacks that are represented in (1) and e > 0 is a non-archimedean element smaller than any positive real number. Remark This non-archimedean concept is drawn from the field of non-standard mathematics. See A. Robinson (1966, 1967). See also the discussion in Arnold et al. (1998) which uses this non-standard approach to extend the usual duality relations in linear programming. Moreover, this e > 0 need not be specified explicitly. It is usually handled in a two-stage manner as follows: Stage 1: An optimal value is secured for h ¼ h with (1). Stage 2: the h in the constraints of (1) are fixed at h = h * and the sum of the slacks represented in (11) is then maximized. Use of (11) replaces Definition 1 with the following, for full P-K efficiency, Definition 3: Part 1: The performance of DMU o is evaluated by z(x,y) 1 and is efficient if and only if z * (x,y) =1. Part 2: The latter condition is achieved with the CCR (Charnes et al. 1978) measure if and only if the following two conditions are both satisfied at an optimum, (i) h * =1 (ii) All slacks are zero. This satisfies (F2 ), the condition added to (A) by D&K, as well as (F2) because this measure is complete i.e., it reflects all inefficiencies that the model can identify. We now turn to (F4) in (A) and start this discussion by using (i) to evaluate point b of Fig. 1 with the objective in (1) replaced with the objective in (11) to obtain, min h e s 1 þ s 2 þ sþ 1k a þ 2k b þ 3k c þ 3k d þ s 1 ¼ 2h 3k a þ 3k b þ 2k c þ 1k d þ s 2 ¼ 3h k b þ k b þ k c þ k d s þ ¼ 1; along with non-negativity for the variables and the integer condition in (2), as required for region (i) in (3). This problem has as its solution h * =1,k * a =1,s * 1 =1. Hence the objective has value zx,y) =h * 1e ) = (1 e )<1 so b is evaluated by point a and identified as not efficient by Definition 3. To show how (F4) of (A) is satisfied we start by noting that this slack value of unity represents the difference in the coordinates of b at x 1 = 2 and the coordinate of a at x 1 =1. That is, the slack s * 1 = 1 represents the difference in the x 1 coordinate for points a and b on this interval of the isoquant. Now as movement is effected from b to a, the value of the slack variable decreases because the associated x 1 coordinate value decreases. This conforms to the
5 J Prod Anal (2008) 29: conditions specified in (F4). That is, as the coordinate for x 1 is reduced and the value of the objective is increased. This same condition is present at all points as movement is made from b to a with a slack value of zero at the latter point which is thus characterized as efficient by Definition 3. Thus, in strictly monotonic fashion (F4) is satisfied at every point on the segment from a to b. This same situation occurs on the segment of the frontier extending upward from point a with x 2 replacing x 1 as the input of interest. Jumping to the other side of Fig. 1 this same situation also occurs with d serving as the efficient point from which all points on the vertical and horizontal segments are evaluated. Finally, the points in the open interval from b to c are all efficient as was shown in our opening example. Hence conformance to the requirements in (F4) is secured in this manner. Conversely, on the open interval between points b and c and at points a and d it is not possible to reduce either input without also increasing the other input in order to stay within the production possibility set. Hence the conditions for recourse to (F4) are not present in this interval. Clearly the Farrell-Debreu measure defined in (1) cannot satisfy (F4) since that measure is incomplete. This situation is remedied by the CCR measure defined in (11) which was introduced into the DEA literature in Charnes et al. in Therefore, we have now shown that the pertinent points in Fig. 1 all satisfy (F4). Finally, as already noted, use of (11) for the objective satisfies (F2 ). Hence all of the conditions specified by D&K are satisfied. 4 Bol and multiplicative models We now turn to Bol (1986) and utilize the multiplicative model introduced in Charnes et al. (1982) to find that Bol s nonexistence example was also already outdated at time of publication. For this purpose we take only the first of the nonexistence examples in Bol since his second example was designed only to show that non-convexity was not the source of his nonexistence demonstration. The example supplied by Bol is represented in Fig. 2, below, where the level line L(u) is given by: x 1 x 2 u 2 for 0 x 1 u x 2 u for u x 1 2u x 1 x 2 2u 2 for 2u x 1 : ð12þ For our counter to this example we will simply show how Fig. 2, as defined in (12), can be reduced to a variant of Fig. 1. For this purpose we turn to the class of multiplicative models, introduced into the DEA literature in the following form by Charnes et al. (1982) max Qs Q s rj =Qm ro =Qm x m i io x m i ij 1; l r ; m i 1; 8r; i: j ¼ 1;...; n ð13þ Noting that Qs y l i ro =Qm x m i io 1 is included as one of the constraints we have Definition 4 only if max Ys The performance of DMU o is efficient if and ro =Ym x m i io ¼ Ys ro =Ym x m i io ¼ 1: To convert (13) to a linear programming problem we use max Ps l r^y ro Pm m i^x io l r^y rj Pm m i^x ij 0; l r ; m i 1 8i; r: j ¼ 1;...; n ð14þ where the caret, ^, denotes logarithm. We now relate this to the additive model. Because (14) is an ordinary linear programming problem it has a dual that can be represented by max Ps s þ r þ Pm s i P n P n x 2 ^y rj k j s þ r ¼ ^y ro ; r ¼ 1;...; s ^x ij k j þ s i ¼ ^x io ; i ¼ 1;...; m k j ; s þ r ; s i 0 8i; j; r; L(u) Fig. 2 Example from Bol (1986) 2u x 1 ð15þ
6 20 J Prod Anal (2008) 29:15 21 which is a version of the additive model introduced in Charnes et al. (1985). This measure is complete so Definition 4 yields the following condition for efficiency:dmu o has performed efficiently if and only if an optimum is achieved with all slacks equal to zero in (15). Proceeding on this route we can now replace (12) with ^x 1 þ ^x 2 2^u for 1^x 1 ^u ^x 2 ^u for ^u ^x 1 ln 2 þ u ^x 1 þ ^x 2 ln 2 þ 2^u for 2^u ^x 1 : ð16þ Figure 3 provides a graphic portrayal of this transformation from Fig. 2. Figure 3 is very much like Fig. 1 so, again, we find that the inefficiencies fail to be identified by (1) when the data stated in logarithmic units lie in the interval ^u ^x 1 ln 2 þ ^u. Because non-zero slack is present, however, this difficulty is avoided by using (15) because, by Definition 3, this non-zero slack designates DMU o as inefficient. Hence, again, the difficulty is confined to cases in which the measure is not complete. There are deficiencies in the use of this measure because (14), like the additive model, need not equal unity when DMU o is efficient. Turning to the multiplier (dual) model in (13), however, and taking anti-logs we return to Definition 4 and the unity criterion is satisfied. n Another deficiency is identifiable because (13) is not units invariant a property not specified by Bol or by D&K. However, this is remedied in Charnes et al. (1983) where a units invariant version of the multiplicative model results in a generalization of Cobb-Douglas functions to multiples of such functions, with each involving multiple outputs and multiple inputs. A great variety of standard formulations in economics, finance and other fields, are also opened for possible use and further research along these lines. Banker and Maindiratta (1986), for example, use piecewise loglinear extensions of (13) to comprehend production possibility sets which are quasi-concave as well as quasi-convex. Hence the usual sequence of increasing, constant and decreasing returns to scale is thereby relaxed. In addition Banker et al. (2004b) show how exact (numerically valued) elasticities of scale can be obtained from these multiple output-multiple input formulations. Moreover, these elasticity values do not depend on the existence of derivatives so the findings by Forsund (1996, p. 290) 5 that exact elasticities cannot be obtained in DEA is not correct because, once again, the findings of nonexistence result from confining attention to models with radial measures that are not complete. 5 Summary and conclusions We have here shown that D&K and Bol both have shortcomings because the measures they consider are incomplete. We have also shown how to remove this deficiency by replacing the Debreu-Farrell measure in (1) with the CCR measure in (11). We then showed how multiplicative models can be used to relate the supposed counter example in Bol to an example like the one used by D&K. As noted earlier, all of these models and measures were published prior to the publication by D&K and by Bol. Moreover, the development of DEA has proceeded at accelerating rates to introduce new models and methods which have many more attractive features. An example is the RAM model of Cooper et al. (1999) which does not use non-archimedean concepts but provides a measure that is complete and is also both strongly monotonic and affine invariant so that it is (1) units invariant and (2) translation invariant. Hence, the assumption of data positivity is not necessary when RAM is used. Acknowldgements We are grateful to a referee whose comments led to a great improvement over the original version of this paper. Support from the IC2 Institute for this research is also gratefully acknowledged by W.W. Cooper ˆx 2 References 2û û ˆx 1 + ˆx 2 2û ˆx 2 û ˆx 1 + x ln2 ˆ2 + 2uˆ Arnold V, Bardhan I, Cooper WW, Gallegos A (1998) Primal and dual optimality in computer codes using two-stage solution procedure in DEA. In: Aranson J, Zionts S (eds) Operations research: methods, models and applications. Westport, Conn. Quorum Books Banker RD, Cooper WW, Seiford LM, Zhu J (2004b) Returns to scale in DEA. In: Cooper WW, Seiford LM, Zhu J (eds) Handbook on data envelopment analysis. Norwell, Mass, Kluwer Academic Publishers. Banker RD, Maindiratta A (1986) Piecewise loglinear estimation of efficient production surfaces. Manage Sci 32: û ln 2 + û ˆx 1 Fig. 3 Bol example in logarithmic units 5 See also Fukuyama (2000, p. 105).
7 J Prod Anal (2008) 29: Bol G (1986) On technical efficiency measures: a remark. J Econ Theory 38: Bradley S, Frey SC (1974) Fractional Programming with Homogeneous Functions. Oper Res 22: Charnes A, Cooper WW (1965) Elements of a strategy for making models in linear programming, Ch. 26. In: Machol R (eds) System engineering handbook. New York, McGraw-Hill, Inc, pp. 1 2 Charnes A, Cooper WW (1962) Programming with linear fractional functionals. Naval Res Logist Quart 9(3 and 4): Charnes A, Cooper WW, Golany B, Seiford L, Stutz J (1985) Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions. J Econ 30:91-l07 Charnes A, Cooper WW, Rhodes ER (1978) Measuring the efficiency of decision making units. Eur J Oper Res 2: Charnes A, Cooper WW, Seiford L, Stutz J (1982) A Multiplicative Model for Efficiency Analysis. Socio-Econ Plan Sci 16: Charnes A, Cooper WW, Seiford L, Stutz J (1983) Invariant multiplicative efficiency and piecewise Cobb-Douglas envelopments. Oper Res Lett 2: Cooper WW, Huang Z, Li S, Parker B, Pastor JT (2007) Aggregation with enhanced Russell measures in DEA. Socio Econ Plan Sci (in press) Cooper WW, Park KS, Pastor JT (1999) RAM: a range adjusted measure of inefficiency for use with additive models, and relations to other models and measures in DEA. J Prod Anal 11:5 42 Cooper WW, Seiford LM, Tone K (2006b) Introduction to data envelopment analysis and its uses with DEA solver software and references. New York, Springer Science and Business Media Debreu G (1951) The coefficient of resource utilization. Econometrica 19, Deprins D, Simar L, Tulkens H (1984) Measuring labor efficiency in post offices. In: Marchand M, Pestiau P, Tulkens H (eds) The performances of public enterprise: concepts and measurement. Amsterdam, North Holland Press Dmitruk AV, Koshevoy GA (1991) On the existence of a technical efficiency criterion. J Econ Theory 55: Färe R, Grosskopf S, Lovell CAK (1985) The measurement of efficiency of production. Boston, Kluwer-Nijhoff Publishing Co Färe R, Lovell CAK (1978) Measuring the technical efficiency of production. J Econ Theory 19: Farrell MJ (1957) The measurement of productive efficiency. J Roy Stat Soc Ser. A 120: Forsund FR (1996) On the calculation of scale elasticities in DEA. J Prod Anal 7: Fukuyama H (2000) Returns to scale and scale elasticity in data envelopment analysis. Eur J Oper Res 125(6): Robinson A (1966) Non-standard analysis: studies in logic and the foundation of mathematics. Amsterdam, North Holland Robinson A (1967) Non standard arithmetic. Bull Am Math Soc 73: Schaible S (1994) Fractional Programming. In: Gass S, Harris CM (eds) Encyclopedia of operations research and management science. Norwell, Mass, Kluwer Academic Publishers, pp Tulkens H (1993) On FDH efficiency analysis: some methodological issues and applications to retail banking, courts and urban transit. J Prod Anal 4:
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 informationLEAST 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 informationAuthor'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 informationFuzzy 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 informationNonparametric Frontier estimation: A Multivariate Conditional Quantile Approach
Nonparametric Frontier estimation: A Multivariate Conditional Quantile Approach Abdelaati Daouia and Léopold Simar GREMAQ, Université de Toulouse I allée de Brienne 3 TOULOUSE, France (e-mail: daouia@cict.fr)
More informationModified 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 informationFree 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 informationNonparametric Frontier Estimation: The Smooth Local Maximum Estimator and The Smooth FDH Estimator
Nonparametric Frontier Estimation: The Smooth Local Maximum Estimator and The Smooth FDH Estimator Hudson da S. Torrent 1 July, 2013 Abstract. In this paper we propose two estimators for deterministic
More informationDATA 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 informationSeveral 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 informationEvaluation 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 informationA 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 informationInterpretation of Dual Model for Piecewise Linear. Programming Problem Robert Hlavatý
Interpretation of Dual Model for Piecewise Linear 1 Introduction Programming Problem Robert Hlavatý Abstract. Piecewise linear programming models are suitable tools for solving situations of non-linear
More informationAUTHOR COPY. DEA cross-efficiency evaluation under variable returns to scale
Journal of the Operational Research Society (2015) 66, 476 487 2015 Operational Research Society Ltd. All rights reserved. 0160-5682/15 www.palgrave-journals.com/jors/ DEA cross-efficiency evaluation under
More informationTHE 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 informationGOAL GEOMETRIC PROGRAMMING PROBLEM (G 2 P 2 ) WITH CRISP AND IMPRECISE TARGETS
Volume 4, No. 8, August 2013 Journal of Global Research in Computer Science REVIEW ARTICLE Available Online at www.jgrcs.info GOAL GEOMETRIC PROGRAMMING PROBLEM (G 2 P 2 ) WITH CRISP AND IMPRECISE TARGETS
More informationMATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS
MATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS GRADO EN A.D.E. GRADO EN ECONOMÍA GRADO EN F.Y.C. ACADEMIC YEAR 2011-12 INDEX UNIT 1.- AN INTRODUCCTION TO OPTIMIZATION 2 UNIT 2.- NONLINEAR PROGRAMMING
More informationGraphs 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 informationObtaining a Feasible Geometric Programming Primal Solution, Given a Near-Optimal Dual Solution
Obtaining a Feasible Geometric Programming Primal Solution, Given a ear-optimal Dual Solution DEIS L. BRICKER and JAE CHUL CHOI Dept. of Industrial Engineering The University of Iowa June 1994 A dual algorithm
More informationNonparametric Efficiency Analysis: A Multivariate Conditional Quantile Approach
Nonparametric Efficiency Analysis: A Multivariate Conditional Quantile Approach Abdelaati Daouia GREMAQ, Université de Toulouse I and LSP, Université de Toulouse III Abdelaati.Daouia@math.ups-tlse.fr Léopold
More informationMath 5593 Linear Programming Final Exam
Math 5593 Linear Programming Final Exam Department of Mathematical and Statistical Sciences University of Colorado Denver, Fall 2013 Name: Points: /30 This exam consists of 6 problems, and each problem
More informationLinear and Integer Programming (ADM II) Script. Rolf Möhring WS 2010/11
Linear and Integer Programming (ADM II) Script Rolf Möhring WS 200/ Contents -. Algorithmic Discrete Mathematics (ADM)... 3... 4.3 Winter term 200/... 5 2. Optimization problems 2. Examples... 7 2.2 Neighborhoods
More informationDiscrete 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 informationUsing 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 informationA gradient-based multiobjective optimization technique using an adaptive weighting method
10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA A gradient-based multiobjective optimization technique using an adaptive weighting method Kazuhiro
More informationTHE REFERENCE POINT METHOD APPLIED TO DECISION SELECTION IN THE PROCESS OF BILATERAL NEGOTIATIONS
QUANTITATIVE METHODS IN ECONOMICS Vol. XV, No. 2, 24, pp. 44 56 THE REFERENCE POINT METHOD APPLIED TO DECISION SELECTION IN THE PROCESS OF BILATERAL NEGOTIATIONS Andrzej Łodziński Department of Econometrics
More informationA new method for solving fuzzy linear fractional programs with Triangular Fuzzy numbers
A new method for solving fuzzy linear fractional programs with Triangular Fuzzy numbers Sapan Kumar Das A 1, S. A. Edalatpanah B 2 and T. Mandal C 1 1 Department of Mathematics, National Institute of Technology,
More informationOptimization with linguistic variables
Optimization with linguistic variables Christer Carlsson christer.carlsson@abo.fi Robert Fullér rfuller@abo.fi Abstract We consider fuzzy mathematical programming problems (FMP) in which the functional
More informationTwo Upper Bounds for the Erdős Szekeres Number with Conditions
Discrete Comput Geom (2013) 49:183 188 DOI 10.1007/s00454-012-9474-9 Two Upper Bounds for the Erdős Szekeres Number with Conditions Florian Strunk Received: 8 July 2011 / Revised: 2 July 2012 / Accepted:
More informationAn algorithmic method to extend TOPSIS for decision-making problems with interval data
Applied Mathematics and Computation 175 (2006) 1375 1384 www.elsevier.com/locate/amc An algorithmic method to extend TOPSIS for decision-making problems with interval data G.R. Jahanshahloo, F. Hosseinzadeh
More information1 Linear programming relaxation
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Primal-dual min-cost bipartite matching August 27 30 1 Linear programming relaxation Recall that in the bipartite minimum-cost perfect matching
More informationSome 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 informationRanking 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 informationLecture 5: Properties of convex sets
Lecture 5: Properties of convex sets Rajat Mittal IIT Kanpur This week we will see properties of convex sets. These properties make convex sets special and are the reason why convex optimization problems
More informationAN 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 informationAM 121: Intro to Optimization Models and Methods Fall 2017
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 10: Dual Simplex Yiling Chen SEAS Lesson Plan Interpret primal simplex in terms of pivots on the corresponding dual tableau Dictionaries
More informationConditional Nonparametric Frontier Models for Convex and Non Convex Technologies: a Unifying Approach
Conditional Nonparametric Frontier Models for Convex and Non Convex Technologies: a Unifying Approach Cinzia Daraio IIT-CNR and Scuola Superiore S. Anna, Italy cinzia@sssup.it, cinzia.daraio@iit.cnr.it
More informationMTAEA Convexity and Quasiconvexity
School of Economics, Australian National University February 19, 2010 Convex Combinations and Convex Sets. Definition. Given any finite collection of points x 1,..., x m R n, a point z R n is said to be
More informationMath 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 informationcontrol polytope. These points are manipulated by a descent method to compute a candidate global minimizer. The second method is described in Section
Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex Ivo Nowak September 3, 1998 Keywords:global optimization, nonconvex quadratic programming, heuristics, Bezier methods,
More information3 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 informationFuzzy multi objective linear programming problem with imprecise aspiration level and parameters
An International Journal of Optimization and Control: Theories & Applications Vol.5, No.2, pp.81-86 (2015) c IJOCTA ISSN:2146-0957 eissn:2146-5703 DOI:10.11121/ijocta.01.2015.00210 http://www.ijocta.com
More informationMath 414 Lecture 30. The greedy algorithm provides the initial transportation matrix.
Math Lecture The greedy algorithm provides the initial transportation matrix. matrix P P Demand W ª «2 ª2 «W ª «W ª «ª «ª «Supply The circled x ij s are the initial basic variables. Erase all other values
More informationLinear 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 informationAn introduction to pplex and the Simplex Method
An introduction to pplex and the Simplex Method Joanna Bauer Marc Bezem Andreas Halle November 16, 2012 Abstract Linear programs occur frequently in various important disciplines, such as economics, management,
More informationConvexity Theory and Gradient Methods
Convexity Theory and Gradient Methods Angelia Nedić angelia@illinois.edu ISE Department and Coordinated Science Laboratory University of Illinois at Urbana-Champaign Outline Convex Functions Optimality
More informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge October 20, 2016 Abstract We consider the problem of minimizing
More informationOn 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"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 informationOn Solving Fuzzy Rough Linear Fractional Programming Problem
On Solving Fuzzy Rough Linear Fractional Programming Problem El-saeed Ammar 1 Mohamed Muamer 2 1 Professor Dept. of mathematics Faculty of science. Tanta University. Tanta Egypt 2 PhD student of mathematics
More informationBilinear Programming
Bilinear Programming Artyom G. Nahapetyan Center for Applied Optimization Industrial and Systems Engineering Department University of Florida Gainesville, Florida 32611-6595 Email address: artyom@ufl.edu
More informationA 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 information3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs
11 3.1 Forms of linear programs... 12 3.2 Basic feasible solutions... 13 3.3 The geometry of linear programs... 14 3.4 Local search among basic feasible solutions... 15 3.5 Organization in tableaus...
More informationSHORTCUT METHODS FOR SIMPLEX- BASED SENSITIVITY ANALYSIS OF LINEAR PROGRAMMING AND RELATED SOFTWARE ISSUES. 1. Introduction 1. Muwafaq M.
International Journal for Quality Research 11(1) 29 22 ISSN 18-645 Muwafaq M. Alkubaisi 1 Article info: Received 18.7.216 Accepted 7.1.216 UDC 4.2 DOI 1.18421/IJQR11.1-13 SHORTCUT METHODS FOR SIMPLEX-
More informationOptimization 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 informationOptimality certificates for convex minimization and Helly numbers
Optimality certificates for convex minimization and Helly numbers Amitabh Basu Michele Conforti Gérard Cornuéjols Robert Weismantel Stefan Weltge May 10, 2017 Abstract We consider the problem of minimizing
More informationSolutions for Operations Research Final Exam
Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem
More informationMetaheuristic Optimization with Evolver, Genocop and OptQuest
Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:
More informationAhigh school curriculum in Algebra 2 contains both solving systems of linear equations,
The Simplex Method for Systems of Linear Inequalities Todd O. Moyer, Towson University Abstract: This article details the application of the Simplex Method for an Algebra 2 class. Students typically learn
More information5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY
5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5.1 DUALITY Associated with every linear programming problem (the primal) is another linear programming problem called its dual. If the primal involves
More informationCOMPENDIOUS LEXICOGRAPHIC METHOD FOR MULTI-OBJECTIVE OPTIMIZATION. Ivan P. Stanimirović. 1. Introduction
FACTA UNIVERSITATIS (NIŠ) Ser. Math. Inform. Vol. 27, No 1 (2012), 55 66 COMPENDIOUS LEXICOGRAPHIC METHOD FOR MULTI-OBJECTIVE OPTIMIZATION Ivan P. Stanimirović Abstract. A modification of the standard
More informationMaxDEA 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 informationOn 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 informationON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE**
Chin. Ann. of Math. 23B:(2002),87-9. ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE** XU Changqing* DING Ren* Abstract The authors discuss the partition of a finite set of points in the plane
More informationChapter II. Linear Programming
1 Chapter II Linear Programming 1. Introduction 2. Simplex Method 3. Duality Theory 4. Optimality Conditions 5. Applications (QP & SLP) 6. Sensitivity Analysis 7. Interior Point Methods 1 INTRODUCTION
More informationLecture 2 Optimization with equality constraints
Lecture 2 Optimization with equality constraints Constrained optimization The idea of constrained optimisation is that the choice of one variable often affects the amount of another variable that can be
More informationOn Fuzzy Topological Spaces Involving Boolean Algebraic Structures
Journal of mathematics and computer Science 15 (2015) 252-260 On Fuzzy Topological Spaces Involving Boolean Algebraic Structures P.K. Sharma Post Graduate Department of Mathematics, D.A.V. College, Jalandhar
More informationQuasilinear First-Order PDEs
MODULE 2: FIRST-ORDER PARTIAL DIFFERENTIAL EQUATIONS 16 Lecture 3 Quasilinear First-Order PDEs A first order quasilinear PDE is of the form a(x, y, z) + b(x, y, z) x y = c(x, y, z). (1) Such equations
More informationBlock-based Thiele-like blending rational interpolation
Journal of Computational and Applied Mathematics 195 (2006) 312 325 www.elsevier.com/locate/cam Block-based Thiele-like blending rational interpolation Qian-Jin Zhao a, Jieqing Tan b, a School of Computer
More informationData Envelopment Analysis (DEA) with Maple in Operations Research and Modeling Courses
Data Envelopment Analysis (DEA) with Maple in Operations Research and Modeling Courses Wm C Bauldry BauldryWC@appstate.edu http://www.mathsci.appstate.edu/ wmcb March, 2009 Abstract We will present the
More informationLecture 2 Convex Sets
Optimization Theory and Applications Lecture 2 Convex Sets Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Fall 2016 2016/9/29 Lecture 2: Convex Sets 1 Outline
More informationThe Paired Assignment Problem
Open Journal of Discrete Mathematics, 04, 4, 44-54 Published Online April 04 in SciRes http://wwwscirporg/ournal/odm http://dxdoiorg/0436/odm044007 The Paired Assignment Problem Vardges Melkonian Department
More informationOptimization Problems Under One-sided (max, min)-linear Equality Constraints
WDS'12 Proceedings of Contributed Papers, Part I, 13 19, 2012. ISBN 978-80-7378-224-5 MATFYZPRESS Optimization Problems Under One-sided (max, min)-linear Equality Constraints M. Gad Charles University,
More informationExtensions of Semidefinite Coordinate Direction Algorithm. for Detecting Necessary Constraints to Unbounded Regions
Extensions of Semidefinite Coordinate Direction Algorithm for Detecting Necessary Constraints to Unbounded Regions Susan Perrone Department of Mathematics and Statistics Northern Arizona University, Flagstaff,
More informationConvex Optimization MLSS 2015
Convex Optimization MLSS 2015 Constantine Caramanis The University of Texas at Austin The Optimization Problem minimize : f (x) subject to : x X. The Optimization Problem minimize : f (x) subject to :
More informationFully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon
Fully discrete Finite Element Approximations of Semilinear Parabolic Equations in a Nonconvex Polygon Tamal Pramanick 1,a) 1 Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationGlobal Minimization via Piecewise-Linear Underestimation
Journal of Global Optimization,, 1 9 (2004) c 2004 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Global Minimization via Piecewise-Linear Underestimation O. L. MANGASARIAN olvi@cs.wisc.edu
More informationH. 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 informationAlgorithms for Integer Programming
Algorithms for Integer Programming Laura Galli November 9, 2016 Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is
More informationNumerical Method in Optimization as a Multi-stage Decision Control System
Numerical Method in Optimization as a Multi-stage Decision Control System B.S. GOH Institute of Mathematical Sciences University of Malaya 50603 Kuala Lumpur MLYSI gohoptimum@gmail.com bstract: - Numerical
More informationCategorical equivalence of some algebras
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 16, Number 2, 2012 Available online at www.math.ut.ee/acta/ Categorical equivalence of some algebras Oleg Košik Abstract. We show that
More informationA Simplex Based Parametric Programming Method for the Large Linear Programming Problem
A Simplex Based Parametric Programming Method for the Large Linear Programming Problem Huang, Rujun, Lou, Xinyuan Abstract We present a methodology of parametric objective function coefficient programming
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationFEAR 1.14 User s Guide
FEAR 1.14 User s Guide Paul W. Wilson Department of Economics 222 Sirrine Hall Clemson University Clemson, South Carolina 29634 USA pww@clemson.edu 10 October 2010 This manual is for FEAR version 1.14,
More informationA Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems
A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems Keely L. Croxton Fisher College of Business The Ohio State University Bernard Gendron Département
More informationPackage additivedea. October 2, 2017
Package additivedea October 2, 2017 Type Package Title Additive Data Envelopment Analysis Models Version 1.1 Date 2017-10-02 Author Andreas Diomedes Soteriades Maintainer Andreas Diomedes Soteriades
More informationEXTREME 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 informationIZAR THE CONCEPT OF UNIVERSAL MULTICRITERIA DECISION SUPPORT SYSTEM
Jana Kalčevová Petr Fiala IZAR THE CONCEPT OF UNIVERSAL MULTICRITERIA DECISION SUPPORT SYSTEM Abstract Many real decision making problems are evaluated by multiple criteria. To apply appropriate multicriteria
More informationFormal Model. Figure 1: The target concept T is a subset of the concept S = [0, 1]. The search agent needs to search S for a point in T.
Although this paper analyzes shaping with respect to its benefits on search problems, the reader should recognize that shaping is often intimately related to reinforcement learning. The objective in reinforcement
More informationTMA946/MAN280 APPLIED OPTIMIZATION. Exam instructions
Chalmers/GU Mathematics EXAM TMA946/MAN280 APPLIED OPTIMIZATION Date: 03 05 28 Time: House V, morning Aids: Text memory-less calculator Number of questions: 7; passed on one question requires 2 points
More informationBi-objective Network Flow Optimization Problem
Bi-objective Network Flow Optimization Problem Pedro Miguel Guedelha Dias Department of Engineering and Management, Instituto Superior Técnico June 2016 Abstract Network flow problems, specifically minimum
More informationFACES OF CONVEX SETS
FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.
More informationShiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 2. Convex Optimization
Shiqian Ma, MAT-258A: Numerical Optimization 1 Chapter 2 Convex Optimization Shiqian Ma, MAT-258A: Numerical Optimization 2 2.1. Convex Optimization General optimization problem: min f 0 (x) s.t., f i
More informationThe Geometry of Carpentry and Joinery
The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison School of Computer Science, Carleton University, 115 Colonel By Drive Ottawa, Ontario, CANADA K1S 5B6 Abstract In this paper we propose
More information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
More informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June
More informationSolution Methods Numerical Algorithms
Solution Methods Numerical Algorithms Evelien van der Hurk DTU Managment Engineering Class Exercises From Last Time 2 DTU Management Engineering 42111: Static and Dynamic Optimization (6) 09/10/2017 Class
More informationExponential Membership Functions in Fuzzy Goal Programming: A Computational Application to a Production Problem in the Textile Industry
American Journal of Computational and Applied Mathematics 2015, 5(1): 1-6 DOI: 10.5923/j.ajcam.20150501.01 Exponential Membership Functions in Fuzzy Goal Programming: A Computational Application to a Production
More informationAn algorithm for censored quantile regressions. Abstract
An algorithm for censored quantile regressions Thanasis Stengos University of Guelph Dianqin Wang University of Guelph Abstract In this paper, we present an algorithm for Censored Quantile Regression (CQR)
More information