Author's personal copy
|
|
- Lester Garrison
- 6 years ago
- Views:
Transcription
1 European Journal of Operational Research 202 (2010) Contents lists available at ScienceDirect European Journal of Operational Research journal homepage: Production, Manufacturing and Logistics Deriving the DEA frontier for two-stage processes Yao Chen a, Wade D. Cook b, Joe Zhu c, * a College of Management, University of Massachusetts at Lowell, Lowell, MA 01845, USA b Schulich School of Business, York University, Toronto, Ontario, Canada M3J 1P3 c Department of Management, Worcester Polytechnic Institute, Worcester, MA 01609, USA article info abstract Article history: Received 19 July 2008 Accepted 11 May 2009 Available online 18 May 2009 Keywords: Data envelopment analysis (DEA) Efficiency Two-stage Intermediate measure Frontier Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). Recently DEA has been extended to examine the efficiency of two-stage processes, where all the outputs from the first stage are intermediate measures that make up the inputs to the second stage. The resulting two-stage DEA model provides not only an overall efficiency score for the entire process, but as well yields an efficiency score for each of the individual stages. Due to the existence of intermediate measures, the usual procedure of adjusting the inputs or outputs by the efficiency scores, as in the standard DEA approach, does not necessarily yield a frontier projection. The current paper develops an approach for determining the frontier points for inefficient DMUs within the framework of two-stage DEA. Ó 2009 Elsevier B.V. All rights reserved. 1. Introduction Data envelopment analysis (DEA) is an approach for identifying best practices of peer decision making units (DMUs), in the presence of multiple inputs and outputs (Charnes et al., 1978). DEA provides not only efficiency scores for inefficient DMUs, but also provides for efficient projections for those units onto an efficient frontier. In recent years, a number of DEA studies have focused on two-stage processes. For example, Seiford and Zhu (1999) develop a DEA approach for evaluating US commercial banks in a two-stage process characterized by profitability and marketability. In their study, profitability is measured using labor and assets as inputs, and the outputs are profits and revenue. In the second stage for marketability, the profits and revenue are then used as inputs, while market value, returns and earnings per share are used as outputs. Zhu (2000) applies the same two-stage process to the Fortune Global 500 companies. Sexton and Lewis (2003) study the Major League Baseball performance in a two-stage process. In their paper, Seiford and Zhu apply the standard DEA approach to each stage, but do not address potential conflicts between the two stages arising from the intermediate measures. For example, the second stage may have to reduce its inputs (intermediate measures) in order to achieve an efficient status. Such an action would, however, imply a reduction in the first stage outputs, thereby reducing the efficiency of that stage. * Corresponding author. addresses: Yao_Chen@uml.edu (Y. Chen), wcook@schulich.yorku.ca (W.D. Cook), jzhu@wpi.edu (J. Zhu). A number of DEA studies have been developed in an attempt to address this type of conflict. For example, the network DEA approach of Färe and Whittaker (1995), Färe and Grosskopf (1996), and Färe and Grosskopf (2000) is used by Lewis and Sexton (2004) to compute the efficiency scores of sub-units. The approach of Sexton and Lewis (2003) is to apply a methodology similar to that of Seiford and Zhu (1999) (although using an output-oriented DEA model), and then suggest as an overall efficiency score, using the ratio of outputs from the second stage to the projected outputs from the first stage. Related work is given in Pendharkar et al. (2000) and Pendharkar and Rodger (2009) using Bayesian network classifiers, in the context of DEA, for mining breast cancer patterns. Kao and Hwang (2008) develop a different approach where the entire two-stage process can be decomposed into the product of the efficiencies of the two sub-processes. As a result, both the overall efficiency and each stage s efficiency are obtained. There are also other DEA studies that deal with multiple stages and/or DMUs with internal structures. See Castelli et al. (in press) for an excellent review of various DEA approaches in dealing with the internal structures of DMUs. In the current study we focus on a particular, and typical case of a two-stage process where all outputs from the first stage are intermediate measures (nothing leaves the system at that point), becoming the inputs to the second stage. As pointed out by a number of authors, including Kao and Hwang (2008), Lewis and Sexton (2004), and Castelli et al. (in press), adjusting the inputs and outputs by the efficiency scores in a two-stage process is generally not sufficient to yield a frontier projection. Chen et al. (2009) present a model similar to that of Kao and Hwang (2008), but in an additive format. However, as with the multiplicative setup, the usual input and output adjustments do /$ - see front matter Ó 2009 Elsevier B.V. All rights reserved. doi: /j.ejor
2 Y. Chen et al. / European Journal of Operational Research 202 (2010) not yield the efficient frontier here either. For many of the cases addressed in the DEA literature dealing with structured DMUs, this will be the situation. In the sections to follow we show that the overall efficiency scores resulting from Kao and Hwang (2008) are not direct indicators of potential input reductions or output increases not realized by the inefficient DMUs, e.g. how much more output each DMU can produce given its present inputs, or how much each DMU could reduce its input-use while still producing the same output. In other words, the resulting DEA scores do not provide complete information on how to project inefficient DMUs onto the DEA frontier for a specific two-stage process. Although we know the efficiency scores, we still do not know where the DEA frontier is. The current paper develops an approach for determining the DEA frontier or DEA projections for inefficient DMUs under the framework of Kao and Hwang (2008). Section 2 presents the generic two-stage process and the Kao and Hwang s (2008) model. In Section 3 we revisit their application involving Taiwanese non-life insurance companies and illustrate the fact that none of the DMUs are efficient, meaning that the usual DEA projections fail to identify the frontier. We then develop an approach for determining the DEA frontier for the two-stage processes, and illustrate this using the aforementioned data set. Conclusions are given in Section Input- and output-oriented DEA models for two-stage processes Consider a generic two-stage process as shown in Fig. 1, for each of a set of n DMUs. We assume each DMU j ðj 1; 2;...; nþ has m inputs x ij ði 1; 2;...; mþ to the first stage, and D outputs z dj ðd 1; 2;...; DÞ from that stage. These D outputs then become the inputs to the second stage, hence behaving as intermediate measures. The outputs from the second stage are y rj ðr 1; 2;...; sþ Input orientation For DMU j we denote the efficiency ratios for the first stage as h 1 j and the second as h 2 j. Based upon the input-oriented DEA model of Charnes et al. (1978), we define P D w P s dz dj P m and h v 2 j u ry rj P i x D ij ~w ; ð1þ dz dj h 1 j where v i ; w d ; ~w d, and u r are unknown non-negative weights. It is assumed that w d are set equal to ~w d as in Kao and Hwang (2008). Asa result, the two-stage overall efficiency ratio is defined as h 1 j h P 2 j s which is equal to h j ury ro P m v. To calculate the overall efficiency i x io of h j, Kao and Hwang (2008) present the following model P s Max h 1 j h 2 j u ry ro Pm v i x io ð2þ h 1 j < 1 and h 2 j 6 1 and w d ~w d : Applying the usual transformation, model (2) can be converted into the following linear program Stage 1 DMU j, j = 1,2,..., n x ij, i = 1,2,,,, m z dj, d = 1,2,..., D Fig. 1. Two-stage process. Stage 2 y rj, r = 1,2,..., s Max Xs X m u r y ro w d z dj Xm v i x io 1; w d z dj 6 0; v i x ij 6 0; j 1;2;...;n; j 1;2;...;n; w d P 0; d 1;2;...;D; v i P; i 1;2;...;m; u r P;r 1;2;...;s: ð3þ Note that constraints P s u ry rj P m v i x ij 6 0 are redundant in Kao and Hwang s (2008) model, because P s u ry rj P D w dz dj 6 0 and P D w dz dj P m v i x ij 6 0 imply P s u ry rj P m v i x ij 6 0. The dual to model (3) can be expressed as h k j x ij 6 hx io ; i 1; 2;...; m; y rj P y ro ; r 1; 2;...; m; ðk j Þz dj P 0; d 1; 2;...; D; k j ; P 0; h 6 1: 2.2. Output orientation The output-oriented version of the above model is given by P m v i x ij0 Ps u ry rj0 ð5þ h 1 j < 1 and h 2 j 6 1 for al; w d ~w d for all d; which is equivalent to the linear programming formulation Xm v i x io w d z dj Xm u r y ro 1; w d z dj 6 0; j 1; 2;...; n; v i x ij < 0; j 1; 2;...; n; w d ; d 1; 2;...; D; v i ; i 1; 2;...; m; u r ; r 1; 2;...; s P 0: ð6þ The dual to model (6) can be expressed as Max / k j x ij 6 x io ; i 1; 2;...; m; y rj P /y ro ; r 1; 2;...; m; ðk j Þz dj P 0; d 1; 2;...; D; k j ; P 0; / P 1: ð4þ ð7þ
3 140 Y. Chen et al. / European Journal of Operational Research 202 (2010) Note that both the input- and output-oriented two-stage DEA models (4) and (7) are identical to the standard DEA envelopment model if k j. To illustrate their model, Kao and Hwang (2008) present a numerical example with three DMUs A, B, and C which use 2, 4, and 5 units of input X to produce 1.5, 4, and 4 units of intermediate product Z at stage 1, which in turn become inputs to stage 2 to produce 1.5, 5, and 6 units of output Y, respectively. It is shown that DMU A has an overall score of 0.5, indicating that this DMU would be able to produce twice as much if it used its inputs efficiently. In this example the overall DEA efficiency scores show how much more output each DMU can produce given its present inputs, or how much each DMU could reduce its input-use while still producing the same output. i.e., the overall efficiency scores obtained from model (4) (or (7)) are intended to identify the DEA frontier points. The following discussion shows that this is not true and that we, therefore, need alternative models to determine the frontier points for two-stage processes. 3. The DEA frontier We here revisit the two-stage application involving 24 Taiwanese non-life insurance companies studied in Kao and Hwang (2008). The two stages represent premium acquisition and profit generation respectively. The inputs to the first stage are operational expenses and insurance expenses, and the outputs from the second stage are underwriting profit and investment profit. There are two intermediate measures between the two stages, namely direct written premiums and reinsurance premiums (see Kao and Hwang (2008) for detailed discussion on these measures). The data appear in Table 1. The second and third columns of Table 2 report the overall efficiency scores obtained from models (4) and (7), respectively. It can be seen that h j 1=/ j for all the DMUs, as expected under the condition of constant returns to scale (CRS). As in the standard DEA approach, we first calculate the DEA projections by multiplying the current inputs (outputs) with the related optimal values h ð/ Þ while keeping the intermediate measures constant. We then apply these DEA projections to models (4) and (7) to examine whether they are efficient. Note that the current paper does not consider potential DEA slacks in the projections. We consider two cases. In Case I, all the DMUs are first replaced by the projected DMUs and then models (4) and (7) are applied. Namely, in model (4), for al, x 1j and x 2j are replaced with h j x 1j and h j x 2j and all the intermediate measures and outputs are kept unchanged, and in model (7), for al, y 1j and y 2j are replaced with / j y 1j and / j y 2j, and all the intermediate measures and inputs are kept unchanged. The fourth column of Table 2 reports the input-oriented scores obtained from model (4) and the fifth column of Table 2 displays the output-oriented scores obtained from model (7). It can be seen that none of the projected DMUs are efficient. It can also be seen that the newly obtained h j is no longer equal to 1=/ j. In Case II, we only replace the DMU under evaluation by its projection in models (4) and (7). Namely, we apply models (4) and (7) to the projected DMU o, and the data for other DMU j ðj oþ remain unchanged. The seventh column of Table 2 reports the input-oriented scores obtained from model (4) and the eighth column of Table 2 displays the output-oriented scores obtained from model (7). It can be seen that except for DMUs 3 and 22 (under the input orientation), and DMUs 9, 12, 15 and 19 (under the output orientation), none of the projected DMUs are efficient. Also, models (4) and (7) do not identify the same efficient DMUs. It can also be seen that the output-oriented score is not equal to the reciprocal of the input-oriented score for all the DMUs, as expected under the condition of CRS. Under the standard DEA approach, Case I and Case II should yield identical results. However, Case I and Case II yield very different results under both models (4) and (7). Thus, models (4) and (7) only yield an overall efficiency score, but fail to provide the complete information on how to project inefficient DMUs on to the DEA frontier. Table 1 Data set. DMU Operation expenses (X1) Insurance expenses (X2) Direct written premiums (Z1) Reinsurance premiums (Z2) Underwriting profit (Y1) Investment profit (Y2) 1 Taiwan Fire 1,178, ,512 7,451, , , ,687 2 Chung Kuo 1,381,822 1,352,755 10,020,274 1,812,894 1,228, ,754 3 Tai Ping 1,177, ,790 4,776, , , ,428 4 China Mariners 601, ,259 3,174, , , ,331 5 Fubon 6,699,063 3,531,614 37,392,862 1,753,794 7,851,229 3,925,272 6 Zurich 2,627, ,363 9,747, ,326 1,713, ,058 7 Taian 1,942,833 1,443,100 10,685, ,412 2,239, ,039 8 g Tai 3,789,001 1,873,530 17,267,266 1,134,600 3,899, ,868 9 Central 1,567, ,432 11,473, ,337 1,043, , The First 1,303,249 1,298,470 8,210, ,528 1,697, , Kuo Hua 1,962, ,414 7,222, ,178 1,486,014 18, Union 2,592, ,952 9,434,406 1,118,489 1,574, , Shingkong 2,609,941 1,368,802 13,921, ,343 3,609, , South China 1,396, ,888 7,396, ,509 1,401, , Cathay Century 2,184, ,063 10,422, ,893 3,355, , Allianz President 1,211, ,071 5,606, , , , Newa 1,453,797 1,085,019 7,695, ,489 3,144, , AIU 757, ,997 3,631, , , , North America 159, ,338 1,141, , ,121 46, Federal 145,442 53, , , ,624 26, Royal & 84,171 26, ,888 40,542 51, Sunalliance 22 Aisa 15,993 10,502 52,063 14,574 82, AXA 54,693 28, ,910 49, , Mitsui Sumitomo 163, , , , ,370 16,976 Source: Kao and Hwang (2008).
4 Y. Chen et al. / European Journal of Operational Research 202 (2010) Table 2 DEA scores. DMU Input-oriented Output-oriented Efficiency scores for projected DMUs Case I a Case II b Input-oriented Output-oriented 1/Output-oriented score Input-oriented Output-oriented 1/Input-oriented score a b Case I: All DMUs are replaced with their projections. Case II: Only the DMU under evaluation is replaced with its projection, and the data for other DMUs remain unchanged. To address this deficiency, we propose a model that is equivalent to model (4) (or model (7)) and generates a set of new inputs, outputs and intermediate measures that constitute an efficient point (projection) under model (4) (or (7)). To this end, consider the input-oriented model (4). For each DMU o, we introduce ~z do ðd 1;...; DÞ, representing a set of new intermediate measures to be determined. We then break the constraints P n ðk j Þz dj P 0 into two new sets of constraints z dj 6 ~z do ; d 1;...; D: The first new set of constraints treats the ~z do as outputs, and the second set treats the ~z do as inputs. We now propose the following DEA type model: min ~ h k j x ij 6 ~ hx io ; i 1;...; m; y rj P y ro ; r 1;...; s; z dj 6 ~z do ; d 1;...; D; ~z do P 0; d 1;...; D; k j P 0; j 1;...; n; P 0; j 1;...; n; ~h 6 1: We will show that model (8) and model (4) yield the same efficiency score, and model (8) provides an efficient projection. ð8þ The dual to model (8) can be expressed as: Max Xs u r y ro w 1 d z dj Xm w 2 d z dj 6 0; j 1;2;...:;n; v i x ij 6 0; j 1;2;...;n; Table 3 Optimal intermediate measures for DEA frontier. DMU Input-oriented (model 8) Output-oriented (model 10) z1 z2 z1 z2 1 5,129, , ,335, , ,287, , ,063,742 1,324, ,776, ,244 6,922, , ,332, , ,379, , ,127,364 4,177,166 39,280,374 5,446, ,807, , ,769,924 1,117, ,738, , ,516,290 2,364, ,553,015 1,009,007 20,180,210 3,666, ,166, , ,703,191 1,575, ,417, , ,480,468 1,440, , , ,745,796 1,608, ,166, , ,434,406 1,118, ,649, , ,748,722 3,100, ,749, , ,526,595 1,575, ,663, , ,226,915 1,033, ,899, , ,932, , ,504, , ,735,516 2,014, ,356, , ,242, , , ,242 1,154, , , , , , , , , ,063 14,574 88, , , , , , , , ,184, ,366.5 ð9þ
5 142 Y. Chen et al. / European Journal of Operational Research 202 (2010) X m v i x io 1; w 2 d w1 d 6 0; d 1;2;...;D; w 1 d ; w2 d P 0; d 1;2;...;D; v i P; i 1;2;...;m; u r P; r 1;2;...;s Note that in model (8), the constraints ~z do P 0 are redundant, hence we can omit ~z do P 0, and let the ~z do be unrestricted variables. Then, the constraint w 2 d w1 d 6 0; d 1; 2;...; D in model (9) becomes w 2 d w1 d meaning that we put the same weights w d on the z dj in both settings (as outputs from stage 1 and as inputs to stage 2), as in model (2). Thus, problem (9) above is identical to problem (3). This further indicates that model (8) yields the same overall efficiency score as model (4). Based upon model (8), the projection point for DMU o is given by ð ~ h x io ; ~z dj ; y roþ which is efficient under models (8) and (4), namely the optimal objective function value for model (8) is equal to unity for this projection. In a similar manner, we can show that in the output-oriented case, model (7) is equivalent to the following model max ~ / k j x ij 6 x io ; i 1;...; m; y rj P ~ /y ro ; r 1;...; s; z dj 6 ~z do ; d 1;...; D; ~z do P 0; d 1;...; D; k j P 0; j 1;...; n; P 0; j 1;...; n; / P 1: ð10þ Model (10) yields a set of new inputs, outputs and intermediate measures that render the DMU efficient under model (7). From model (8) or (10), it can be seen that in addition to the overall efficiency scores, we have to obtain a set of optimal intermediate measures (z). Models (4) and (7) do not immediately yield the set of optimal z values that are on the DEA frontier, rather we have to use model (8) or (10) to determine the frontier points for two-stage processes. Table 3 reports the optimal intermediate measures for both orientations, obtained from models (8) and (10). If we apply the new (projected) DMUs with the intermediate measures reported in Table 3 and h j x 1j and h j x 2j (or / j y 1j and / j y 2j) to model (4) (or (7)) under either Case I or Case II, the overall efficiency scores are all equal to one. Note that under the input-oriented models, for DMUs 3 and 22, model (8) indicates the newly obtained intermediate measures are equal to the original values. This is confirmed by the fact that model (4) identifies DMUs 3 and 22 as efficient under the Case II. The same situation is found for DMU12 under the output-oriented models. While DMUs 9, 15 and 19 are efficient under model (7), model (10) identifies a set of different values on intermediate measures for DMUs 9, 15 and 19 (see the last two columns of Table 3). This indicates that multiple optimal solutions exist for intermediate measures in models (8) and (10). In fact, if we calculate model (10) using the original intermediate values and / j y 1j and / j y 2j for DMUs 9, 15, and 19, model (10) yields an efficiency score of Conclusions This paper develops models for determining the DEA frontier points (projections) for inefficient DMUs under the framework of the DEA model for two-stage processes. The current study is based upon the assumption of constant returns to scale (CRS). Chen et al. (2009) develop a two-stage DEA model under the condition of variable returns to scale (VRS) wherein the overall efficiency is expressed as a (weighted) sum of the efficiencies of the individual stages. Although overall VRS efficiency scores as well as scores for individual stages can be obtained by using Chen et al. (2009), adjusting the inputs or outputs by the efficiency scores is not sufficient to yield VRS frontier projections. Because Chen et al. (2009) focus on the additive efficiency decomposition, the newly developed approach in the current study cannot be (directly) applied. Further study is then needed to develop models for determining the DEA frontier points for VRS inefficient DMUs. The presented model has important applications in areas such as supply chain management. With the need to better understand supply chains and to be able to evaluate the performance of supply chain members, tools such as that provided herein can provide new insights. The model has the advantage of providing a clear indication of where the strengths and weaknesses exist in such multi-stage settings. In the banking environment, there is also a need for tools that allow one to uncover inefficiencies in different components of the operation. Many of the bank s operations take the form of two-stage processes. Customer deposits can be viewed as outputs in regard to the service being supplied by branch staff, but at the same time deposits are also inputs to the consumer and business loan part of the bank s operation. To address the many practical problems encountered in settings such as these, we suggest that more work be done on multi-stage processes to enhance the usefulness of tools of the type presented herein. Acknowledgement The authors thank three anonymous reviewers for their comments and suggestions. References Castelli, L., Pesenti, R., Ukovich, W., in press. A classification of DEA models when the internal structure of the Decision Making Units is considered, Annals of Operations Research. Charnes, A., Cooper, W.W., Rhodes, E., Measuring the efficiency of decision making units. European Journal of Operational Research 2, Chen, Y., Cook, W.D., Li, N., Zhu, J., Additive efficiency decomposition in twostage DEA. European Journal of Operational Research 196, Färe, R., Grosskopf, S., Productivity and intermediate products: A frontier approach. Economics Letters 50, Färe, R., Grosskopf, S., Network DEA. Socio-Economic Planning Sciences 34, Färe, R., Whittaker, G., An intermediate input model of dairy production using complex survey data. Journal of Agricultural Economics 46 (2), Kao, C., Hwang, S.-N., Efficiency decomposition in two-stage data envelopment analysis: An application to non-life insurance companies in Taiwan. European Journal of Operational Research 185 (1), Lewis, H.F., Sexton, T.R., Network DEA: Efficiency analysis of organizations with complex internal structures. Computers and Operations Research 31 (9), Pendharkar, P.C., Rodger, J.A., The relationship between software development team size and software development cost. Communications of the ACM 52 (2), 1 4. Pendharkar, P.C., Khosrowpour, M., Rodger, J.A., Application of Bayesian network classifiers and data envelopment analysis for mining breast cancer patterns. Journal of Computer Information Systems 4, Seiford, L.M., Zhu, J., Profitability and marketability of the top 55 US commercial banks. Management Science 45 (9), Sexton, T.R., Lewis, H.F., Two-stage DEA: An application to major league baseball. Journal of Productivity Analysis 19 (2-3), Zhu, J., Multi-factor performance measure model with an application to Fortune 500 companies. European Journal of Operational Research 123 (1),
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 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 informationA 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 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 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 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 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 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 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 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 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 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 informationComparing performance of educational system of world s continents: A fuzzy three-stage DEA model
International Mathematical Forum, 5, 2010, no. 58, 2885-2900 Comparing performance of educational system of world s continents: A fuzzy three-stage DEA model A. Abbasi 1, Department of Educational Sciences,
More informationStepwise selection of variables in data envelopment analysis: Procedures and managerial perspectives
European Journal of Operational Research 180 (2007) 57 67 Continuous Optimization Stepwise selection of variables in data envelopment analysis: Procedures and managerial perspectives Janet M. Wagner *,
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 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 informationGuidelines 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 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 informationInfluence of fuzzy norms and other heuristics on Mixed fuzzy rule formation
International Journal of Approximate Reasoning 35 (2004) 195 202 www.elsevier.com/locate/ijar Influence of fuzzy norms and other heuristics on Mixed fuzzy rule formation Thomas R. Gabriel, Michael R. Berthold
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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationADVANCED IMAGE PROCESSING METHODS FOR ULTRASONIC NDE RESEARCH C. H. Chen, University of Massachusetts Dartmouth, N.
ADVANCED IMAGE PROCESSING METHODS FOR ULTRASONIC NDE RESEARCH C. H. Chen, University of Massachusetts Dartmouth, N. Dartmouth, MA USA Abstract: The significant progress in ultrasonic NDE systems has now
More informationA Survey on Postive and Unlabelled Learning
A Survey on Postive and Unlabelled Learning Gang Li Computer & Information Sciences University of Delaware ligang@udel.edu Abstract In this paper we survey the main algorithms used in positive and unlabeled
More informationChapter 2 Improved Multiple Attribute Decision Making Methods
Chapter 2 Improved Multiple Attribute Decision Making Methods The improved multiple attribute decision making methods for decision making in the manufacturing environment are described in this chapter.
More informationComputational efficiency analysis of Wu et al. s fast modular multi-exponentiation algorithm
Applied Mathematics and Computation 190 (2007) 1848 1854 www.elsevier.com/locate/amc Computational efficiency analysis of Wu et al. s fast modular multi-exponentiation algorithm Da-Zhi Sun a, *, Jin-Peng
More informationDiscrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs
Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results
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 informationChapter 2 Intuitionistic Fuzzy Aggregation Operators and Multiattribute Decision-Making Methods with Intuitionistic Fuzzy Sets
Chapter 2 Intuitionistic Fuzzy Aggregation Operators Multiattribute ecision-making Methods with Intuitionistic Fuzzy Sets 2.1 Introduction How to aggregate information preference is an important problem
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 informationPipeline Givens sequences for computing the QR decomposition on a EREW PRAM q
Parallel Computing 32 (2006) 222 230 www.elsevier.com/locate/parco Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM q Marc Hofmann a, *, Erricos John Kontoghiorghes b,c a Institut
More informationLecture notes on Transportation and Assignment Problem (BBE (H) QTM paper of Delhi University)
Transportation and Assignment Problems The transportation model is a special class of linear programs. It received this name because many of its applications involve determining how to optimally transport
More informationIntegration of information security and network data mining technology in the era of big data
Acta Technica 62 No. 1A/2017, 157 166 c 2017 Institute of Thermomechanics CAS, v.v.i. Integration of information security and network data mining technology in the era of big data Lu Li 1 Abstract. The
More informationPreprocessing DEA. February to provide tools that will reduce the computational burden of DEA studies especially in large scale applications.
Preprocessing DEA. J.H. Dulá 1 and F.J. López 2 February 2007 Statement of Scope and Purpose. This is a comprehensive study of preprocessing in DEA. The purpose is to provide tools that will reduce the
More informationDesign and Realization of Agricultural Information Intelligent Processing and Application Platform
Design and Realization of Agricultural Information Intelligent Processing and Application Platform Dan Wang 1,2 1 Institute of Agricultural Information, Chinese Academy of Agricultural Sciences, Beijing
More informationInteger Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University
Integer Programming Xi Chen Department of Management Science and Engineering International Business School Beijing Foreign Studies University Xi Chen (chenxi0109@bfsu.edu.cn) Integer Programming 1 / 42
More informationEuropean Journal of Operational Research
European Journal of Operational Research 196 (2009) 266 272 Contents lists available at ScienceDirect European Journal of Operational Research journal homepage: wwwelseviercom/locate/ejor Decision Support
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 informationA flexible biometrics remote user authentication scheme
Computer Standards & Interfaces 27 (2004) 19 23 www.elsevier.com/locate/csi A flexible biometrics remote user authentication scheme Chu-Hsing Lin*, Yi-Yi Lai Department of Computer Science and Information
More informationA Note on the Separation of Subtour Elimination Constraints in Asymmetric Routing Problems
Gutenberg School of Management and Economics Discussion Paper Series A Note on the Separation of Subtour Elimination Constraints in Asymmetric Routing Problems Michael Drexl March 202 Discussion paper
More informationDecision Support Systems
Decision Support Systems 48 (2010) 430 436 Contents lists available at ScienceDirect Decision Support Systems journal homepage: www.elsevier.com/locate/dss Classification by vertical and cutting multi-hyperplane
More informationEfficient Prefix Computation on Faulty Hypercubes
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 17, 1-21 (21) Efficient Prefix Computation on Faulty Hypercubes YU-WEI CHEN AND KUO-LIANG CHUNG + Department of Computer and Information Science Aletheia
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 informationASIAN JOURNAL OF MANAGEMENT RESEARCH Online Open Access publishing platform for Management Research
ASIAN JOURNAL OF MANAGEMENT RESEARCH Online Open Access publishing platform for Management Research Copyright 2010 All rights reserved Integrated Publishing association Review Article ISSN 2229 3795 The
More informationEmergence of Business Continuity to Ensure Business and IT Operations. Solutions to successfully meet the requirements of business continuity.
Emergence of Business Continuity to Ensure Business and IT Operations Solutions to successfully meet the requirements of business continuity. 2 3 4 5 Introduction Use of Virtualization Technology as a
More informationA Mathematical Approach to Solve Data Envelopment Analysis Models when Data are LR Fuzzy Numbers
Applied Mathematical Sciences, Vol. 3, 2009, no. 48, 2383-2396 A Mathematical Approach to Solve Data Envelopment Analysis Models when Data are LR Fuzzy Numbers Houssine Tlig Ecole Nationale d Ingenieurs
More informationAssume we are given a tissue sample =, and a feature vector
MA 751 Part 6 Support Vector Machines 3. An example: Gene expression arrays Assume we are given a tissue sample =, and a feature vector x œ F Ð=Ñ $!ß!!! consisting of 30,000 gene expression levels as read
More informationA noninformative Bayesian approach to small area estimation
A noninformative Bayesian approach to small area estimation Glen Meeden School of Statistics University of Minnesota Minneapolis, MN 55455 glen@stat.umn.edu September 2001 Revised May 2002 Research supported
More informationVariable Neighborhood Search Based Algorithm for University Course Timetabling Problem
Variable Neighborhood Search Based Algorithm for University Course Timetabling Problem Velin Kralev, Radoslava Kraleva South-West University "Neofit Rilski", Blagoevgrad, Bulgaria Abstract: In this paper
More informationLizhe Sun. November 17, Florida State University. Ranking in Statistics and Machine Learning. Lizhe Sun. Introduction
in in Florida State University November 17, 2017 Framework in 1. our life 2. Early work: Model Examples 3. webpage Web page search modeling Data structure Data analysis with machine learning algorithms
More information4. References. q h-1. q h
4. References -1-2 Fig. 5 polygon on which the DSW algorithm fails. C 1 Bhattacharya B K, ElGindy H. new linear convex hull algorithm for simple polygons. IEEE Transactions on Information Theory. 1994,
More informationChapter 2 Matrix Games with Payoffs of Triangular Fuzzy Numbers
Chapter 2 Matrix Games with Payoffs of Triangular Fuzzy Numbers 2.1 Introduction The matrix game theory gives a mathematical background for dealing with competitive or antagonistic situations arise in
More informationOpen Access Research on the Prediction Model of Material Cost Based on Data Mining
Send Orders for Reprints to reprints@benthamscience.ae 1062 The Open Mechanical Engineering Journal, 2015, 9, 1062-1066 Open Access Research on the Prediction Model of Material Cost Based on Data Mining
More informationFlow equivalent trees in undirected node-edge-capacitated planar graphs
Information Processing Letters 100 (2006) 110 115 www.elsevier.com/locate/ipl Flow equivalent trees in undirected node-edge-capacitated planar graphs Xianchao Zhang a,b, Weifa Liang a,,hejiang b a Department
More informationGeneral 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 informationOptimum Alphabetic Binary Trees T. C. Hu and J. D. Morgenthaler Department of Computer Science and Engineering, School of Engineering, University of C
Optimum Alphabetic Binary Trees T. C. Hu and J. D. Morgenthaler Department of Computer Science and Engineering, School of Engineering, University of California, San Diego CA 92093{0114, USA Abstract. We
More informationeconstor Make Your Publications Visible.
econstor Make Your Publications Visible. A Service of Wirtschaft Centre zbwleibniz-informationszentrum Economics Ziari, Shokrollah; Raissi, Sadigh Article Ranking efficient DMUs using minimizing distance
More informationComputers & Industrial Engineering
Computers & Industrial Engineering 59 (2010) 387 397 Contents lists available at ScienceDirect Computers & Industrial Engineering journal homepage: www.elsevier.com/locate/caie A robust optimization approach
More informationUsing Genetic Algorithm and Tabu Search in DEA
sing Genetic Algorithm and Tabu Search in DEA Gabriel Villa 1, Sebastián Lozano 1 and Fernando Guerrero 1 1 Escuela Superior de Ingenieros. niversidad de Sevilla. Camino de los Descubrimientos s.n., 41092
More informationThe 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 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 informationMeasuring Efficiency using Dynamic Network-Based Data Envelopment Analysis
Measuring Efficiency using Dynamic Network-Based Data Envelopment Analysis Tsutomu Ito, Katsuhiko Takahashi, Katsumi Morikawa, Takao Ito Graduate School of Engineering, Hiroshima University,1-4-1 Kagamiyama,
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 informationData envelopment analysis of clinics with sparse data: fuzzy clustering approach
This is the author s final, peer-reviewed manuscript as accepted for publication. The publisher-formatted version may be available through the publisher s web site or your institution s library. Data envelopment
More informationSelection of Notebook Personal Computers Using Data Envelopment Analysis
Selection of Notebook Personal Computers Using Data Envelopment Analysis Appears in The Southern Business and Economic Journal Volume 23, Number 3, April 2000, 200-214. Patrick R. McMullen * Auburn University
More informationBusse Library, Fall Explore EBSCOHost s Social Sciences and Business Clusters: Locating Periodical Articles
Exploring the Literature of Economics: Using Business Source Complete, SocIndex, The Wiley Online Library, and ScienceDirect Busse Library, Fall 2011 The following print and electronic resources serve
More informationOn The Theoretical Foundation for Data Flow Analysis in Workflow Management
Association for Information Systems AIS Electronic Library (AISeL) AMCIS 2005 Proceedings Americas Conference on Information Systems (AMCIS) 2005 On The Theoretical Foundation for Data Flow Analysis in
More informationFuzzy linear programming technique for multiattribute group decision making in fuzzy environments
Information Sciences 158 (2004) 263 275 www.elsevier.com/locate/ins Fuzzy linear programming technique for multiattribute group decision making in fuzzy environments Deng-Feng Li *, Jian-Bo Yang Manchester
More informationDeriving Trading Rules Using Gene Expression Programming
22 Informatica Economică vol. 15, no. 1/2011 Deriving Trading Rules Using Gene Expression Programming Adrian VISOIU Academy of Economic Studies Bucharest - Romania Economic Informatics Department - collaborator
More informationFeature Selecting Model in Automatic Text Categorization of Chinese Financial Industrial News
Selecting Model in Automatic Text Categorization of Chinese Industrial 1) HUEY-MING LEE 1 ), PIN-JEN CHEN 1 ), TSUNG-YEN LEE 2) Department of Information Management, Chinese Culture University 55, Hwa-Kung
More informationEuropean Journal of Operational Research
European Journal of Operational Research 26 (21) 395 46 Contents lists available at ScienceDirect European Journal of Operational Research journal homepage: www.elsevier.com/locate/ejor Stochastics and
More informationTHE NEW HYBRID COAW METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
THE NEW HYBRID COAW METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS Zeinab Borhanifar and Elham Shadkam * Department of Industrial Engineering, Faculty of Eng.; Khayyam University, Mashhad, Iran ABSTRACT In
More informationTheoretical Computer Science
Theoretical Computer Science 410 (2009) 3372 3390 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs An (18/11)n upper bound for sorting
More informationComplexity Results on Graphs with Few Cliques
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School
More informationA New Approach Spider's Web Initial Solution and Data Envelopment Analysis for Solving an X-bar control chart
A New Approach Spider's Web Initial Solution and Data Envelopment Analysis for Solving an X-bar control chart KOUROSH RANJBAR, HAMID KHALOOZADEH, AGHILEH HEYDARI Abstract: X-bar control charts are widely
More informationM. Yamuna* et al. /International Journal of Pharmacy & Technology
ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com FINDING CRITICAL PATH OF A NETWORK USING MODIFIED DIJKSTRA S ALGORITHM Shantan Sawa, Shivangee Sabharwal, Purushottam
More informationDesign of memory efficient FIFO-based merge sorter
LETTER IEICE Electronics Express, Vol.15, No.5, 1 11 Design of memory efficient FIFO-based merge sorter Youngil Kim a), Seungdo Choi, and Yong Ho Song Department of Electronics and Computer Engineering,
More informationAn Improved Measurement Placement Algorithm for Network Observability
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 4, NOVEMBER 2001 819 An Improved Measurement Placement Algorithm for Network Observability Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper
More informationSUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING
ASIAN JOURNAL OF MATHEMATICS AND APPLICATIONS Volume 2014, Article ID ama0156, 11 pages ISSN 2307-7743 http://scienceasia.asia SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING
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 informationOn anycast routing with bandwidth constraint
Computer Communications 26 (2003) 1541 1550 www.elsevier.com/locate/comcom On anycast routing with bandwidth constraint Chor Ping Low*, Choon Leng Tan School of Electrical and Electronic Engineering, Nanyang
More informationEvaluation of Decision Making Units in the Presence. of Fuzzy and Non-discretionary
Applied Mathematical Sciences, Vol. 7, 2013, no. 28, 1387-1392 HIKARI Ltd, www.m-hikari.com Evaluation of Decision Making Units in the Presence of Fuzzy and Non-discretionary Neda Fathi and Mohammad Izadikhah
More informationUsing a genetic algorithm for editing k-nearest neighbor classifiers
Using a genetic algorithm for editing k-nearest neighbor classifiers R. Gil-Pita 1 and X. Yao 23 1 Teoría de la Señal y Comunicaciones, Universidad de Alcalá, Madrid (SPAIN) 2 Computer Sciences Department,
More informationFitting Uncertain Data with NURBS
Fitting Uncertain Data with NURBS Wolfgang Heidrich, Richard Bartels, George Labahn Abstract. Fitting of uncertain data, that is, fitting of data points that are subject to some error, has important applications
More informationDevelopment of datamining software for the city water supply company
Journal of Physics: Conference Series PAPER OPEN ACCESS Development of datamining software for the city water supply company To cite this article: O G Orlinskaya and E V Boiko 2018 J. Phys.: Conf. Ser.
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 informationAn evaluation approach to engineering design in QFD processes using fuzzy goal programming models
European Journal of Operational Research 7 (006) 0 48 Production Manufacturing and Logistics An evaluation approach to engineering design in QFD processes using fuzzy goal programming models Liang-Hsuan
More informationResearch on Design and Application of Computer Database Quality Evaluation Model
Research on Design and Application of Computer Database Quality Evaluation Model Abstract Hong Li, Hui Ge Shihezi Radio and TV University, Shihezi 832000, China Computer data quality evaluation is the
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 informationFundamentals of Python: First Programs. Chapter 6: Design with Functions
Fundamentals of Python: First Programs Chapter 6: Design with Functions Objectives After completing this chapter, you will be able to: Explain why functions are useful in structuring code in a program
More informationPart 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 informationApplication of Fuzzy Classification in Bankruptcy Prediction
Application of Fuzzy Classification in Bankruptcy Prediction Zijiang Yang 1 and Guojun Gan 2 1 York University zyang@mathstat.yorku.ca 2 York University gjgan@mathstat.yorku.ca Abstract. Classification
More information2016 Fourth Quarter Earnings. March 2017
2016 Fourth Quarter Earnings March 2017 Disclaimer The information is provided for informational purposes only, and is not an offer to buy or sell or a solicitation of an offer to buy or sell any security
More informationData Points Structure Explanatory Documentation
Data Points Structure Explanatory Documentation Version: 0.2 (Public Draft) Publication date: 2009-12-08 Abstract This document contains a description of an approach for the explicit, consistent and coherent
More information6. 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 informationDORO JANUARY-MARCH 2018
DORO JANUARY-MARCH 2018 Robert Puskaric, President & CEO Carl-Johan Zetterberg Boudrie, CFO April 27 th 2018 AGENDA Market update First quarter 2018 Concluding remarks and Q&A session MARKET UPDATE CURRENT
More informationConference call July 26, :00 / Helsinki 08:00 / New York 1 Nokia 2016 Q2 2018
Conference call July 26, 2018 15:00 / Helsinki 08:00 / New York 1 Nokia 2016 Q2 2018 Disclaimer It should be noted that Nokia and its business are exposed to various risks and uncertainties, and certain
More informationA New Meta-heuristic Bat Inspired Classification Approach for Microarray Data
Available online at www.sciencedirect.com Procedia Technology 4 (2012 ) 802 806 C3IT-2012 A New Meta-heuristic Bat Inspired Classification Approach for Microarray Data Sashikala Mishra a, Kailash Shaw
More informationRough Set Approaches to Rule Induction from Incomplete Data
Proceedings of the IPMU'2004, the 10th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Perugia, Italy, July 4 9, 2004, vol. 2, 923 930 Rough
More informationAvailable online at ScienceDirect. Procedia Computer Science 89 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 89 (2016 ) 341 348 Twelfth International Multi-Conference on Information Processing-2016 (IMCIP-2016) Parallel Approach
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 information