Optimization of Gear Pairs Using Genetic Algorithm

Size: px
Start display at page:

Download "Optimization of Gear Pairs Using Genetic Algorithm"

Transcription

1 IOSR Joural of Egieerig (IOSRJEN) ISSN: ISBN: PP Natioal Symposium o egieerig ad Research Optimizatio of Gear Pairs Usig Geetic Algorithm 1 Y.K.Mogal, 2 D.D.Palade, 3 V.D.Wakchaure Departmet of Mechaical Egieerig, MCERC,Nasik Departmet of Mechaical Egieerig, AVCOE,Sagamer Abstract: - Up to ow may optimizatio techiques have bee developed & used for optimizatio of egieerig problems to fid optimum desig. Solvig egieerig problems ca be complex & time cosumig whe there are large umber of desig variables & costraits. A Gear desig require the desiger to compromise may desig variables; i.e. cotiuous, discrete & iteger variables i order to determie best performace of gear set. Therefore a covetioal optimizatio techique has difficulty i solvig those kids of problem. I this paper Geetic algorithm is itroduced for, 1] Miimizatio of power loss of worm gear mechaism with respect to specified set of costraits. 2] Miimizatio of volume of two-stage gear trai. Key words: - Optimizatio, Geetic Algorithm ad Gear 1. INTRODUCTION Desig optimizatio for may egieerig applicatios is multiobjective i ature. Due to coflicts amog objectives, it is impossible to obtai a sigle desig that correspods to optima of all the objectives. A multiobjective optimizatio problem ca be solved usig sigle-objective optimizatio methods, if all the objectives ca be combied ito a sigle objective fuctio by assigig each with a weight coefficiet or if all but oe objective ca be coverted ito costraits [1]. Solvig egieerig problems ca be complex ad a time cosumig process whe there are large umbers of desig variables ad costraits. Hece, there is a eed for more efficiet ad reliable algorithms that solve such problems. The improvemet of faster computer has give chace for more robust ad efficiet optimizatio methods. Geetic algorithm is oe of these methods.[3] Origially developed by Hollad, a geetic algorithm (GA) is a robust techique, based o the atural selectio ad geetic productio mechaism. The geetic algorithm works with a group of possible solutios withi a search space istead of workig with a sigle solutio as is see i gradiet optimizatio methods. [2]. The flow chart of geetic algorithm is show i Fig.1. A iitial populatio is chose radomly at the begiig, ad fitess of iitial populatio idividuals are evaluated. The a iterative process starts util the termiatio criteria have bee ru across. After the evaluatio of idividual fitess i the populatio, the geetic operators, selectio, crossover ad mutatio are applied to breed a ew geeratio. The ewly created idividuals replace the existig geeratio ad reevaluatio is started for fitess of ew idividuals. The loop is repeated util acceptable solutio is foud.[3] Fig.1.Flow chart for GA The desig of gear trai is a kid of mixed problems which have to determie various types of desig variables; i,e.,cotiuous, discrete, ad iteger variables.. I this study, the Geetic Algorithm is itroduced for geometrical volume (size) miimizatio problem of the two-stage gear trai ad the simple plaetary gear trai to show that geetic algorithm is better tha the covetioal algorithms for solvig the problems that have [4] Fiite elemet aalysis (FEA) has proved to be a useful method to aalyze the stregth of worm gears; however, it is usually time cosumig ad difficult for parametric desig, ad, hece, it is difficult to apply FEA for desig optimizatio. To overcome the problem, the authors developed a method, which combies ANN ad GA to optimize worm gear desig based o FEA results. [6] The reductio of vibratio ad oise is owadays a very importat issue i the desig of gear power trasmissios. May authors uderlied 22 P a g e

2 the effect of modificatios o the dyamics of gears: Kahrama ad Blakeship experimetally measured the effect of the ivolutes tip relief o the dyamic respose, while Boori et al. simulated the effect of differet profile modificatios ad maufacturig errors o gear oise. A key poit o the desig process of spur gears is the choice of the best profile modificatio; it is ot trivial difficult to defie desig guidelies for profile modificatios.[7] 2. APPLICATION OF GA FOR POWER LOSS OPTIMIZATION I this study, a o-covetioal algorithm amely geetic algorithm is preseted for miimizatio of power-loss of worm gear mechaism with respect to specified set of costraits. Number of gear tooth, frictio coefficiet, ad helix (thread) agle of worm are used as desig variables ad liear pressure, bedig stregth of tooth, ad deformatio of worm are set as costraits. The results for miimizatio of power-loss of worm gear mechaism are preseted to provide a compariso with aalytical method I the desig of gear set, the shafts agle is 90 o. Trasmissio rate is 1/15; ad three Thread worm. I the worm gear system because of frictio, missig power is tured to heat. The objective fuctio is the power loss with respect to costraits such as liear pressure worm gear tooth, bedig stress of gear tooth for acceptable deflectio, acceptable deflectio of worm shaft.[3] Power loss, ΔP, formulated as: ΔP = P i P o P i : iput power, P o : output power P o =F (cos α cos γ -µ si γ ) * F : F t1 : F : Normal force α :Pressure agle γ :Helix agle µ: Frictio coefficiet m a : Module z g : Number of gear tooth w w : Agular velocity of worm i: Trasmissio rate. 2.1 Objective Fuctio It is desired to obtai the lowest power loss of worm gear mechaism subject to liear Pressure worm gear, bedig stress of gear tooth ad deflectio of worm shaft uder the Load. The objective fuctio is formulated as: F obj =F(z g, γ, µ)=p i - F (cos α cos γ -µ si γ ) * 2.2 Desig Variables ad Parameters Gear tooth umber 21 Z g 80 Frictio coefficiet 0.03 µ 0.05 Helix agle 15 0 γ 25 0 Table 1: Coefficiets ad iput values for sample desig practice Defiitio Symbol Uit Values Iput power P o KW 11 Number of Rpm 720 revolutio tour of worm Trasmissio i rate Ceter distace a mm 200 of worm gear pair Distace L mm 330 betwee of worm shaft bearigs Module m a mm 7 Number of z w - 3 worm teeth Worm diameter do w mm 71 Bottom of teeth df w mm 55 diameter of worm Pressure agle α Degree 22.5 Elasticity E N/mm module Iertia I mm Costraits Costraits are coditios that must be met i the optimum desig ad iclude restrictios o the desig variables. These costraits defie the boudaries of the feasible ad ifeasible desig space domai. The costraits cosidered for the optimum desig of the power loss of worm gear are the followig g j =(Z g, γ, µ) 0 j= 1,. No. of costraits g 1 (x)= * F t1 : Tagetial force : Number of revolutio of worm do w : worm diameter g 2 (x)= P a g e

3 Number of Radomized biary strig Idividual g 3 (x)= 0 g 1 x: Liear pressure worm gear tooth g 2 x: Bedig stress of gear tooth g 3 x :Acceptable deflectio of worm shaft F t2 = F (cos α cos γ -µ si γ ) bo g =0.45(do 1 +6m a ) F tr1 : F r1 : Radial force represeted with Equatio F r1 : F si α Fittess Fuctio =F-[F(Z g, γ, µ)+pf] PF= 2 Cocaated variables head-to-tail *l Populatio Size =165.2 For a strig legth of 27bits, a optimal populatio size of 85 maybe used. Table 4. A set of startig populatio The settig parameters of geetic algorithm for this study are chose as follows: Chromosome legth = 27, Populatio size = 85, Number of geeratio = 100, Crossover Probability = 0.5, Mutatio probability = 0.005, 2.4 Results & Discussio Fig 2 shows the 3-D plots of desig variables values durig the workig of GA. Desig variables have bee got differet values ad take o miimum value of objective fuctio at 69-th geeratio show i Fig 2. It has bee show that desig variables take o values as: umber of gear teeth is 44, frictio coefficiet is , ad helix agle is 5.246o.Fig 2 shows the plots of the helix agle ad umber of worm gear teeth i each geeratio as optimizatio proceed. The overall results show that the best desig coverge 69-th geeratio ad refie the desig over remaiig geeratios,. The results compared with results of aalytical method, show i Table 5. Table 2. Codig of biary desig variable vectors ito biary digits Desig variables Lower limit Upper limit Precisio Strig legth vector Z g γ µ To start the algorithm, a iitial populatio set is radomly assiged. This set of iitialized populatio is potetial solutio to the problem. The biary strig represetatio for the desig variables (Z g, γ, µ) i Table 3 gives a example of a chromosome that represets desig variables accordigly. This desig strig is composed of 27 oes ad zeros. Table 3: The biary strig represetatio of the Gear tooth umber (Z g ) variables Desig Variables Frictio Helix coefficiet (µ ) agle(γ ) Fig.2. Variatio of variables through geeratios Table 5 Compariso of the results Desig Variables Aalytical method Geetic algorithm Number of teeth of worm gear (Z g ) Frictio coefficiet (, µ) Helix agle (, γ, ) o o Miimum power loss KW KW 24 P a g e

4 The startig poit of aalytical method Z g = 45, µ=0.046, γ = : 22.5 o The programme, developed i MATLAB 7.0 for aalytical method has bee ru several time for differet values of desig variables. The results obtaied are give i Table 5. As ca be see from the results, the geetic algorithm produced much better results tha aalytical method. 3. APPLICATION OF GA FOR GEOMETRICAL VOLUME & GEAR RATIO OPTIMIZATION The objectives of the desig are geometrical volume (size) miimizatio of 2-stage gear trai ad that of simple plaetary gear trai that has very valuable aspects i lightweight, small size ad high stregth. With regard to these desig objects, we determie the umber of teeth, module, face width, ad helix agle, cosiderig costraits such as stregth (durability), iterferece, cotact ratio ad other factors based o AGMA stadards4 so that these gear trais ca perform the tasks required i desig specificatio.[4] 3.1Volume Miimizatio of 2-Stage Gear Trai The objective fuctio ad costraits ca be writte as, F objective =w 1 F obj1+ w 2 F obj2 + F obj1 = µ- F obj2 =b s1 ( ) 2 (z 2 1s1+z 2 2s1) +b s2 ( ) 2 (z 2 1s2 + z 2 2s2) G 1 =1.2 σ HS1 -σ H lim G 2 =1.2 σ HS2 -σ H lim G 3 =1.15σ Fs1 - σ F lim σ F lim G 4 =1.15σ Fs1 - G 5 =v ts1 -v tmax G 6 = v ts2 -v tmax G 7 =1-ε αs1 G 8 = ε αs1-2.5 G 9 =1-ε αs2 G 10 = ε αs2-2.5 G 11 =0.8- ε βs1 G 12 = ε βs1-6 G 13 =0.8- ε βs2 G 14 = ε βs2-6 G 15 =b s1cos β s1-2z 1s1 m s1 G 16 =0.5 z 1s1 m s1 - b s1cos β s1 G 17 = b s2cos β s2-2z 1s2 m s2 G 18 = 0.5 z 1s2 m s2 - b s2cos β s2 G 19 = z 1s1 lim - z 1s1 G 20 = z 1s2 lim - z 1s2 G 21 = - G 22 = - where, F obj1 is the objective fuctio for volume miimizatio, F obj2 is the objective fuctio 2 for reductio gear ratio, w 1 ad w 2 are weight factors for F obj1 ad F obj2 respectively, γ p is the pealty coefficiet, ad G j is the violet value of costraits.1 G 1 ~ G 4 represet the costraits for the bedig stregth ad pittig resistace o the 1st ad 2d stage gears cosiderig factor of safety. G 5 ~ G 6 represet the costraits for pitch lie velocity. G 7 ~ G 14 Represet the costraits for cotact ratios. G 15 ~ G 18 represet the costraits for aspect ratios of piio of 1st ad 2d stage. G 19 ~ G 20 represet the costraits for udercut. G 21 ~ G 22 represet costraits for reductio gear ratio ad pitch diameter of gear respectively. Fitess fuctio is costructed by subtractig costructed sigle objective from Cmax, what is a adequate value which prevet the fitess value from beig egative F fitess = Cmax F objective As for parameters used i geetic algorithm, umber of idividuals is 30, the probability of crossover is 0.8,the probability of mutatio is 0.3, ad the algorithm is set to termiate whe the umber of a shift i a geeratio reaches Table 6. Bouds of desig variables for 2-stage gear trai for escalator Desig Bouds variable Z 1s Z 2s Z 1s Z 2s Normal 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, module 0.8,1, 1.25, 1.5, 2, 2.5, 3, 4, (mm) 5, 6, 8,10, 12, 16, 20, 25, 32, 40, 50 b s (mm) b s (mm) β s β s Table 7 Desig specificatio of 2-stage gear trai for escalator Item 1-stage 2-stage Piio Gea r Piio Gear Normal module [mm] Number of teeth Total gear ratio Helix agle [ ] Addedum modificatio coefficiet P a g e

5 Effective face width [mm] Pressure agle [ ] 20 Rotatioal speed of 1750 iput driver [rpm] Trasmitted power 7.5 [kw] Grade (AGMA) 9 Material SCM415 Heat treatmet Carburized & case hardeed Surface hardess HRC 60 Volume (pitch circle) [mm3] Table 8. Desig result of optimizatio Item 1-stage 2-stage Piio Gea r Piio Gear Normal module [mm] Number of teeth Total gear ratio Helix agle [ ] Addedum modificatio coefficiet Effective face width [mm] Pressure agle [ ] 20 Rotatioal speed of 1750 iput driver [rpm] Cotact stress [MPa] Allowable cotact stress [MPa] Bedig Stress [MPa] Allowable bedig stress [MPa] Volume (pitch circle) [mm3] 3.2 Result & Discussio Table 8 shows desig results that are obtaied at 8664 th geeratio, ad from this, we ca easily otice optimum values of iteger ad discrete variables are foud adequately satisfyig costraits. I this desig results, the correctio of solutio accordig to the types of variables after desig is ot eeded. Therefore geetic algorithm is the effective method i desigig gear trais. Fig.3 shows the compariso betwee the model of existig product ad the model havig dimesios foud by optimizatio i this research. I this result, the volume of pitch diameter ad face width is reduced about 40%, ad the error of reductio gear ratio betwee objective ad result are about 3%. 4. CONCLUSION By studyig above cases we cocluded that, while optimizig the complex problems of mechaical system a Geetic Algorithm is importat tool. So optimizatio of gear pair cosistig of various parameters, objectives ad costraits ca be doe easily usig No covetioal optimizatio techique i.e. Geetic Algorithm as compared to covetioal techiques. 5. FUTURE SCOPE By usig GA we ca optimize gearbox by cosiderig differet objective fuctios ad costraits. REFERENCES [1] Hog big Fag, Qia Wag, Multiobjective desig of a vehicular structure usig metamodellig ad a efficiet geetic algorithm, Iteratioal joural of desig Egieerig, Vol. 1,pp.41-55, [2] Khadiza Tahera, Raafat N. Ibrahim, Paul B. Lochert, GADYM - A Novel Geetic Algorithm i Mechaical Desig Problems, Joural of Uiversal Computer Sciece, vol. 14, o. 15,pp ,2008. [3] Muhammet Yama, Hamit Saruha, Faruk Med, Power Loss Optimizatio Of A Worm Gear Mechaism By Usig Geetic Algorithm Techical Educatio Faculty, Machie Desig Ad Costructio Departmet, Kouralp Yerleskes, [4] Tae Hyog Chog* ad Joug Sag Lee, A Desig Method of Gear Trais Usig a Geetic Algorithm, Iteratioal Joural of the Korea Society of Precisio Egieerig, Vol. 1, No. 1, Jue [5] Marco Barbieri, Giorgio Scagliarii, Giorgio Boori, Fracesco Pellicao, Gabriele Bertacchi, Optimizatio Methods For Spur Gear Dyamics, Sait Petersburg, Russia, Jue, 30 July, [6] Daizhog Su Ad Wejie Peg Optimum Desig Of Worm Gears With Multiple Computer Aided Techiques, ICCES, Vol.6, No.4, Pp ,2008. [7] M.Barbieri,G.Boori,G.Scagliarii F.Pellicao, Gear Vibratio Reductio Usig Geetic Algorithms, 12 th IFToMM World Cogress, Besaço (Frace), Jue18-21, 2007 (a) Old model (b) New model Fig.3 Model of 2-stage gear trais of escalator 26 P a g e

Introduction of Expectation-Maximization Algorithm, Cross-Entropy Method and Genetic Algorithm

Introduction of Expectation-Maximization Algorithm, Cross-Entropy Method and Genetic Algorithm Itroductio of Expectatio-Maximizatio Algorithm, Cross-Etropy Method ad Geetic Algorithm Wireless Iformatio Trasmissio System Lab. Istitute of Commuicatios Egieerig Natioal Su Yat-se Uiversity 2012/07/23

More information

Mechanical Efficiency of Planetary Gear Trains: An Estimate

Mechanical Efficiency of Planetary Gear Trains: An Estimate Mechaical Efficiecy of Plaetary Gear Trais: A Estimate Dr. A. Sriath Professor, Dept. of Mechaical Egieerig K L Uiversity, A.P, Idia E-mail: sriath_me@klce.ac.i G. Yedukodalu Assistat Professor, Dept.

More information

DETERMINATION OF MECHANICAL PROPERTIES OF A NON- UNIFORM BEAM USING THE MEASUREMENT OF THE EXCITED LONGITUDINAL ELASTIC VIBRATIONS.

DETERMINATION OF MECHANICAL PROPERTIES OF A NON- UNIFORM BEAM USING THE MEASUREMENT OF THE EXCITED LONGITUDINAL ELASTIC VIBRATIONS. ICSV4 Cairs Australia 9- July 7 DTRMINATION OF MCHANICAL PROPRTIS OF A NON- UNIFORM BAM USING TH MASURMNT OF TH XCITD LONGITUDINAL LASTIC VIBRATIONS Pavel Aokhi ad Vladimir Gordo Departmet of the mathematics

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

A NEW APPROACH TO SOLVE AN UNBALANCED ASSIGNMENT PROBLEM

A NEW APPROACH TO SOLVE AN UNBALANCED ASSIGNMENT PROBLEM A NEW APPROACH TO SOLVE AN UNBALANCED ASSIGNMENT PROBLEM *Kore B. G. Departmet Of Statistics, Balwat College, VITA - 415 311, Dist.: Sagli (M. S.). Idia *Author for Correspodece ABSTRACT I this paper I

More information

MINIMUM-WEIGHT DESIGN OF COMPRESSIVELY LOADED COMPOSITE PLATES AND STIFFENED PANELS FOR POSTBUCKLING STRENGTH BY GENETIC ALGORITHM

MINIMUM-WEIGHT DESIGN OF COMPRESSIVELY LOADED COMPOSITE PLATES AND STIFFENED PANELS FOR POSTBUCKLING STRENGTH BY GENETIC ALGORITHM MINIMUM-WEIGHT DESIGN OF COMPRESSIVELY LOADED COMPOSITE PLATES AND STIFFENED PANELS FOR POSTBUCKLING STRENGTH BY GENETIC ALGORITHM Ji-Ho Kag a, Jae-Hu Lee a, Joo-Hyu Ha a, Chu-Go Kim a, ad Dog-Mi Lee b

More information

An Effective Biogeography Based Optimization Algorithm to Slove Economic Load Dispatch Problem

An Effective Biogeography Based Optimization Algorithm to Slove Economic Load Dispatch Problem Joural of Computer Sciece 8 (9): 482-486, 202 ISSN 549-3636 202 Sciece Publicatios A Effective Biogeography Based Optimizatio Algorithm to Slove Ecoomic Load Dispatch Problem Vaitha, M. ad 2 K. Thaushkodi

More information

IP Reference guide for integer programming formulations.

IP Reference guide for integer programming formulations. IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more

More information

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients. Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,

More information

A NEW CLASS OF 2-STEP RATIONAL MULTISTEP METHODS

A NEW CLASS OF 2-STEP RATIONAL MULTISTEP METHODS Jural Karya Asli Loreka Ahli Matematik Vol. No. (010) page 6-9. Jural Karya Asli Loreka Ahli Matematik A NEW CLASS OF -STEP RATIONAL MULTISTEP METHODS 1 Nazeeruddi Yaacob Teh Yua Yig Norma Alias 1 Departmet

More information

CS537. Numerical Analysis and Computing

CS537. Numerical Analysis and Computing CS57 Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 Jauary 9 9 What is the Root May physical system ca be

More information

Study on Coal Consumption Curve Fitting of the Thermal Power Based on Genetic Algorithm

Study on Coal Consumption Curve Fitting of the Thermal Power Based on Genetic Algorithm Joural of ad Eergy Egieerig, 05, 3, 43-437 Published Olie April 05 i SciRes. http://www.scirp.org/joural/jpee http://dx.doi.org/0.436/jpee.05.34058 Study o Coal Cosumptio Curve Fittig of the Thermal Based

More information

CS321. Numerical Analysis and Computing

CS321. Numerical Analysis and Computing CS Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 September 8 5 What is the Root May physical system ca

More information

1. Introduction. (Received 9 April 2013; accepted 3 June 2013)

1. Introduction. (Received 9 April 2013; accepted 3 June 2013) 1008. Noliear trasiet egagemet characteristics of plaetary gear trai Xueyi Li Shoubo Jiag Sashuai Li Qigliag Zeg 1008. NONLINEAR TRANSIENT ENGAGEMENT CHARACTERISTICS OF PLANETARY GEAR TRAIN. Xueyi Li 1

More information

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series

More information

On comparison of different approaches to the stability radius calculation. Olga Karelkina

On comparison of different approaches to the stability radius calculation. Olga Karelkina O compariso of differet approaches to the stability radius calculatio Olga Karelkia Uiversity of Turku 2011 Outlie Prelimiaries Problem statemet Exact method for calculatio stability radius proposed by

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Chapter Output Aalysis for a Sigle Model Baks, Carso, Nelso & Nicol Discrete-Evet System Simulatio Error Estimatio If {,, } are ot statistically idepedet, the S / is a biased estimator of the true variace.

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

Optimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem

Optimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem Optimizatio Methods: Liear Programmig Applicatios Assigmet Problem Itroductio Module 4 Lecture Notes 3 Assigmet Problem I the previous lecture, we discussed about oe of the bech mark problems called trasportatio

More information

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the

More information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ. 2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For

More information

A Modified Statistical Design Model of Double Sampling X Control Chart

A Modified Statistical Design Model of Double Sampling X Control Chart Proceedigs of the Iteratioal MultiCoferece of Egieers ad Computer Scietists 009 Vol II IMECS 009, March 8-0, 009, Hog Kog A Modified Statistical Desig Model of Double Samplig X Cotrol Chart Chau-Che Torg,

More information

Chapter 6 Sampling Distributions

Chapter 6 Sampling Distributions Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to

More information

DECOMPOSITION METHOD FOR SOLVING A SYSTEM OF THIRD-ORDER BOUNDARY VALUE PROBLEMS. Park Road, Islamabad, Pakistan

DECOMPOSITION METHOD FOR SOLVING A SYSTEM OF THIRD-ORDER BOUNDARY VALUE PROBLEMS. Park Road, Islamabad, Pakistan Mathematical ad Computatioal Applicatios, Vol. 9, No. 3, pp. 30-40, 04 DECOMPOSITION METHOD FOR SOLVING A SYSTEM OF THIRD-ORDER BOUNDARY VALUE PROBLEMS Muhammad Aslam Noor, Khalida Iayat Noor ad Asif Waheed

More information

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios

More information

Lecture 11: Decision Trees

Lecture 11: Decision Trees ECE9 Sprig 7 Statistical Learig Theory Istructor: R. Nowak Lecture : Decisio Trees Miimum Complexity Pealized Fuctio Recall the basic results of the last lectures: let X ad Y deote the iput ad output spaces

More information

Optimization Methods MIT 2.098/6.255/ Final exam

Optimization Methods MIT 2.098/6.255/ Final exam Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short

More information

Reinforcement Learning Based Dynamic Selection of Auxiliary Objectives with Preserving of the Best Found Solution

Reinforcement Learning Based Dynamic Selection of Auxiliary Objectives with Preserving of the Best Found Solution Reiforcemet Learig Based Dyamic Selectio of Auxiliary Objectives with Preservig of the Best Foud Solutio arxiv:1704.07187v1 [cs.ne] 24 Apr 2017 Abstract Efficiecy of sigle-objective optimizatio ca be improved

More information

Using An Accelerating Method With The Trapezoidal And Mid-Point Rules To Evaluate The Double Integrals With Continuous Integrands Numerically

Using An Accelerating Method With The Trapezoidal And Mid-Point Rules To Evaluate The Double Integrals With Continuous Integrands Numerically ISSN -50 (Paper) ISSN 5-05 (Olie) Vol.7, No., 017 Usig A Acceleratig Method With The Trapezoidal Ad Mid-Poit Rules To Evaluate The Double Itegrals With Cotiuous Itegrads Numerically Azal Taha Abdul Wahab

More information

A Note on Matrix Rigidity

A Note on Matrix Rigidity A Note o Matrix Rigidity Joel Friedma Departmet of Computer Sciece Priceto Uiversity Priceto, NJ 08544 Jue 25, 1990 Revised October 25, 1991 Abstract I this paper we give a explicit costructio of matrices

More information

Rank Modulation with Multiplicity

Rank Modulation with Multiplicity Rak Modulatio with Multiplicity Axiao (Adrew) Jiag Computer Sciece ad Eg. Dept. Texas A&M Uiversity College Statio, TX 778 ajiag@cse.tamu.edu Abstract Rak modulatio is a scheme that uses the relative order

More information

Optimal Design of Accelerated Life Tests with Multiple Stresses

Optimal Design of Accelerated Life Tests with Multiple Stresses Optimal Desig of Accelerated Life Tests with Multiple Stresses Y. Zhu ad E. A. Elsayed Departmet of Idustrial ad Systems Egieerig Rutgers Uiversity 2009 Quality & Productivity Research Coferece IBM T.

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

APPENDIX: STUDY CASES A SURVEY OF NONPARAMETRIC TESTS FOR THE STATISTICAL ANALYSIS OF EVOLUTIONARY COMPUTATION EXPERIMENTS

APPENDIX: STUDY CASES A SURVEY OF NONPARAMETRIC TESTS FOR THE STATISTICAL ANALYSIS OF EVOLUTIONARY COMPUTATION EXPERIMENTS A survey of oparametric tests for the statistical aalysis of evolutioary computatio experimets. Appedix 1 APPENDIX: STUDY CASES A SURVEY OF NONPARAMETRIC TESTS FOR THE STATISTICAL ANALYSIS OF EVOLUTIONARY

More information

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals

More information

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass

More information

Stability Analysis of the Euler Discretization for SIR Epidemic Model

Stability Analysis of the Euler Discretization for SIR Epidemic Model Stability Aalysis of the Euler Discretizatio for SIR Epidemic Model Agus Suryato Departmet of Mathematics, Faculty of Scieces, Brawijaya Uiversity, Jl Vetera Malag 6545 Idoesia Abstract I this paper we

More information

True Nature of Potential Energy of a Hydrogen Atom

True Nature of Potential Energy of a Hydrogen Atom True Nature of Potetial Eergy of a Hydroge Atom Koshu Suto Key words: Bohr Radius, Potetial Eergy, Rest Mass Eergy, Classical Electro Radius PACS codes: 365Sq, 365-w, 33+p Abstract I cosiderig the potetial

More information

The Method of Least Squares. To understand least squares fitting of data.

The Method of Least Squares. To understand least squares fitting of data. The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve

More information

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Geometry generation principle and meshing properties of a new gear drive

Geometry generation principle and meshing properties of a new gear drive Bulleti of the JSME Joural of Advaced Mechaical Desig, Systems, ad Maufacturig Vol, No, 08 Geometry geeratio priciple ad meshig properties of a ew gear drive Zhehua HAN*, Wakai SHI*, Chag LIU* ad Lag XU*

More information

μ are complex parameters. Other

μ are complex parameters. Other A New Numerical Itegrator for the Solutio of Iitial Value Problems i Ordiary Differetial Equatios. J. Suday * ad M.R. Odekule Departmet of Mathematical Scieces, Adamawa State Uiversity, Mubi, Nigeria.

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

International Journal of Scientific & Engineering Research Volume 8, Issue 7, July-2017 ISSN

International Journal of Scientific & Engineering Research Volume 8, Issue 7, July-2017 ISSN Iteratioal Joural of Scietific & Egieerig Research Volume 8, Issue, July- ISSN 9-558 8 Estimatio of two layer soil parameters usig traditioal ad evolutioary methods Dr. Abraham George, M.S. Egieerig College,

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Research Article A New Second-Order Iteration Method for Solving Nonlinear Equations

Research Article A New Second-Order Iteration Method for Solving Nonlinear Equations Abstract ad Applied Aalysis Volume 2013, Article ID 487062, 4 pages http://dx.doi.org/10.1155/2013/487062 Research Article A New Secod-Order Iteratio Method for Solvig Noliear Equatios Shi Mi Kag, 1 Arif

More information

Injections, Surjections, and the Pigeonhole Principle

Injections, Surjections, and the Pigeonhole Principle Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam 4 will cover.-., 0. ad 0.. Note that eve though. was tested i exam, questios from that sectios may also be o this exam. For practice problems o., refer to the last review. This

More information

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE Joural of ELECTRICAL EGIEERIG, VOL. 56, O. 7-8, 2005, 200 204 OPTIMAL PIECEWISE UIFORM VECTOR QUATIZATIO OF THE MEMORYLESS LAPLACIA SOURCE Zora H. Perić Veljo Lj. Staović Alesadra Z. Jovaović Srdja M.

More information

arxiv: v1 [cs.ai] 20 Nov 2013

arxiv: v1 [cs.ai] 20 Nov 2013 Aalyzig Evolutioary Optimizatio i Noisy Eviromets Chao Qia, Yag Yu, Zhi-Hua Zhou Natioal Key Laboratory for Novel Software Techology Najig Uiversity, Najig 20023, Chia arxiv:3.4987v [cs.ai] 20 Nov 203

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Obtaining Constants of Johnson-Cook Material Model Using a Combined Experimental, Numerical Simulation and Optimization Method

Obtaining Constants of Johnson-Cook Material Model Using a Combined Experimental, Numerical Simulation and Optimization Method Vol:0, No:9, 06 Obtaiig Costats of Johso-Cook Material Model Usig a Combied Experimetal, Numerical Simulatio ad Optimizatio Method F. Rahimi Dehgola, M. Behzadi, J. Fathi Sola Iteratioal Sciece Idex, Mechaical

More information

Markov Decision Processes

Markov Decision Processes Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes

More information

Teaching Mathematics Concepts via Computer Algebra Systems

Teaching Mathematics Concepts via Computer Algebra Systems Iteratioal Joural of Mathematics ad Statistics Ivetio (IJMSI) E-ISSN: 4767 P-ISSN: - 4759 Volume 4 Issue 7 September. 6 PP-- Teachig Mathematics Cocepts via Computer Algebra Systems Osama Ajami Rashaw,

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B.

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B. Amme 3500 : System Dyamics ad Cotrol Root Locus Course Outlie Week Date Cotet Assigmet Notes Mar Itroductio 8 Mar Frequecy Domai Modellig 3 5 Mar Trasiet Performace ad the s-plae 4 Mar Block Diagrams Assig

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm

More information

567. Research of Dynamics of a Vibration Isolation Platform

567. Research of Dynamics of a Vibration Isolation Platform 567. Research of Dyamics of a Vibratio Isolatio Platform A. Kilikevičius, M. Jurevičius 2, M. Berba 3 Vilius Gedimias Techical Uiversity, Departmet of Machie buildig, J. Basaavičiaus str. 28, LT-03224

More information

MATHEMATICAL MODELLING OF ARCH FORMATION IN GRANULAR MATERIALS

MATHEMATICAL MODELLING OF ARCH FORMATION IN GRANULAR MATERIALS 6 th INTERNATIONAL MULTIDISCIPLINARY CONFERENCE MATHEMATICAL MODELLING OF ARCH FORMATION IN GRANULAR MATERIALS Istva eppler SZIE Faculty of Mechaics, H-2103 Gödöllő Páter. 1., Hugary Abstract: The mathematical

More information

Integer Programming (IP)

Integer Programming (IP) Iteger Programmig (IP) The geeral liear mathematical programmig problem where Mied IP Problem - MIP ma c T + h Z T y A + G y + y b R p + vector of positive iteger variables y vector of positive real variables

More information

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0. THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of

More information

Because it tests for differences between multiple pairs of means in one test, it is called an omnibus test.

Because it tests for differences between multiple pairs of means in one test, it is called an omnibus test. Math 308 Sprig 018 Classes 19 ad 0: Aalysis of Variace (ANOVA) Page 1 of 6 Itroductio ANOVA is a statistical procedure for determiig whether three or more sample meas were draw from populatios with equal

More information

Chapter 7 z-transform

Chapter 7 z-transform Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time

More information

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.

More information

ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND

ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND Pacific-Asia Joural of Mathematics, Volume 5, No., Jauary-Jue 20 ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND SHAKEEL JAVAID, Z. H. BAKHSHI & M. M. KHALID ABSTRACT: I this paper, the roll cuttig problem

More information

The Mathematical Model and the Simulation Modelling Algoritm of the Multitiered Mechanical System

The Mathematical Model and the Simulation Modelling Algoritm of the Multitiered Mechanical System The Mathematical Model ad the Simulatio Modellig Algoritm of the Multitiered Mechaical System Demi Aatoliy, Kovalev Iva Dept. of Optical Digital Systems ad Techologies, The St. Petersburg Natioal Research

More information

Computational Intelligence Winter Term 2018/19

Computational Intelligence Winter Term 2018/19 Computatioal Itelligece Witer Term 28/9 Prof. Dr. Güter Rudolph Lehrstuhl für Algorithm Egieerig (LS ) Fakultät für Iformatik TU Dortmud Pla for Today Lecture Evolutioary Algorithms (EA) Optimizatio Basics

More information

Modified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations

Modified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations Noliear Aalysis ad Differetial Equatios, Vol. 5, 27, o. 4, 57-7 HIKARI Ltd, www.m-hikari.com https://doi.org/.2988/ade.27.62 Modified Decompositio Method by Adomia ad Rach for Solvig Noliear Volterra Itegro-

More information

NUMERICAL METHODS FOR SOLVING EQUATIONS

NUMERICAL METHODS FOR SOLVING EQUATIONS Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:

More information

Numerical Method for Blasius Equation on an infinite Interval

Numerical Method for Blasius Equation on an infinite Interval Numerical Method for Blasius Equatio o a ifiite Iterval Alexader I. Zadori Omsk departmet of Sobolev Mathematics Istitute of Siberia Brach of Russia Academy of Scieces, Russia zadori@iitam.omsk.et.ru 1

More information

Introduction to Signals and Systems, Part V: Lecture Summary

Introduction to Signals and Systems, Part V: Lecture Summary EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive

More information

Classification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)

Classification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc) Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:

More information

Short Term Load Forecasting Using Artificial Neural Network And Imperialist Competitive Algorithm

Short Term Load Forecasting Using Artificial Neural Network And Imperialist Competitive Algorithm Short Term Load Forecastig Usig Artificial eural etwork Ad Imperialist Competitive Algorithm Mostafa Salamat, Mostafa_salamat63@yahoo.com Javad Mousavi, jmousavi.sh1365@gmail.com Seyed Hamid Shah Alami,

More information

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

More information

[Sharma* et al., 5.(6): June, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Sharma* et al., 5.(6): June, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY A GENETIC ALGORITHM FOR PERFORMANCE OPTIMIZATION OF A STOCHASTIC FLOW NETWORK WITH COST ATTRIBUTE IN TERMS OF MINIMAL CUTS Diksha

More information

PARETO-OPTIMAL SOLUTION OF A SCHEDULING PROBLEM ON A SINGLE MACHINE WITH PERIODIC MAINTENANCE AND NON-PRE-EMPTIVE JOBS

PARETO-OPTIMAL SOLUTION OF A SCHEDULING PROBLEM ON A SINGLE MACHINE WITH PERIODIC MAINTENANCE AND NON-PRE-EMPTIVE JOBS Proceedigs of the Iteratioal Coferece o Mechaical Egieerig 2007 (ICME2007) 2-3 December 2007, Dhaka, Bagladesh ICME07-AM-6 PARETO-OPTIMAL SOLUTION OF A SCHEDULING PROBLEM ON A SINGLE MACHINE WITH PERIODIC

More information

CALCULUS BASIC SUMMER REVIEW

CALCULUS BASIC SUMMER REVIEW CALCULUS BASIC SUMMER REVIEW NAME rise y y y Slope of a o vertical lie: m ru Poit Slope Equatio: y y m( ) The slope is m ad a poit o your lie is, ). ( y Slope-Itercept Equatio: y m b slope= m y-itercept=

More information

1 Duality revisited. AM 221: Advanced Optimization Spring 2016

1 Duality revisited. AM 221: Advanced Optimization Spring 2016 AM 22: Advaced Optimizatio Sprig 206 Prof. Yaro Siger Sectio 7 Wedesday, Mar. 9th Duality revisited I this sectio, we will give a slightly differet perspective o duality. optimizatio program: f(x) x R

More information

Upper bound for ropelength of pretzel knots

Upper bound for ropelength of pretzel knots Upper boud for ropelegth of pretzel kots Safiya Mora August 25, 2006 Abstract A model of the pretzel kot is described. A method for predictig the ropelegth of pretzel kots is give. A upper boud for the

More information

FAILURE CRITERIA: MOHR S CIRCLE AND PRINCIPAL STRESSES

FAILURE CRITERIA: MOHR S CIRCLE AND PRINCIPAL STRESSES LECTURE Third Editio FAILURE CRITERIA: MOHR S CIRCLE AND PRINCIPAL STRESSES A. J. Clark School of Egieerig Departmet of Civil ad Evirometal Egieerig Chapter 7.4 b Dr. Ibrahim A. Assakkaf SPRING 3 ENES

More information

Section 5.1 The Basics of Counting

Section 5.1 The Basics of Counting 1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of

More information

The target reliability and design working life

The target reliability and design working life Safety ad Security Egieerig IV 161 The target reliability ad desig workig life M. Holický Kloker Istitute, CTU i Prague, Czech Republic Abstract Desig workig life ad target reliability levels recommeded

More information

Reliability and Queueing

Reliability and Queueing Copyright 999 Uiversity of Califoria Reliability ad Queueig by David G. Messerschmitt Supplemetary sectio for Uderstadig Networked Applicatios: A First Course, Morga Kaufma, 999. Copyright otice: Permissio

More information

Principle Of Superposition

Principle Of Superposition ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give

More information

Linear Programming and the Simplex Method

Linear Programming and the Simplex Method Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is

More information

Electricity consumption forecasting method based on MPSO-BP neural network model Youshan Zhang 1, 2,a, Liangdong Guo2, b,qi Li 3, c and Junhui Li2, d

Electricity consumption forecasting method based on MPSO-BP neural network model Youshan Zhang 1, 2,a, Liangdong Guo2, b,qi Li 3, c and Junhui Li2, d 4th Iteratioal Coferece o Electrical & Electroics Egieerig ad Computer Sciece (ICEEECS 2016) Electricity cosumptio forecastig method based o eural etwork model Yousha Zhag 1, 2,a, Liagdog Guo2, b,qi Li

More information

Analysis of Algorithms. Introduction. Contents

Analysis of Algorithms. Introduction. Contents Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Damped Vibration of a Non-prismatic Beam with a Rotational Spring

Damped Vibration of a Non-prismatic Beam with a Rotational Spring Vibratios i Physical Systems Vol.6 (0) Damped Vibratio of a No-prismatic Beam with a Rotatioal Sprig Wojciech SOCHACK stitute of Mechaics ad Fudametals of Machiery Desig Uiversity of Techology, Czestochowa,

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

6.003 Homework #3 Solutions

6.003 Homework #3 Solutions 6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the

More information

Properties of Fuzzy Length on Fuzzy Set

Properties of Fuzzy Length on Fuzzy Set Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

subject to A 1 x + A 2 y b x j 0, j = 1,,n 1 y j = 0 or 1, j = 1,,n 2

subject to A 1 x + A 2 y b x j 0, j = 1,,n 1 y j = 0 or 1, j = 1,,n 2 Additioal Brach ad Boud Algorithms 0-1 Mixed-Iteger Liear Programmig The brach ad boud algorithm described i the previous sectios ca be used to solve virtually all optimizatio problems cotaiig iteger variables,

More information

Robust Resource Allocation in Parallel and Distributed Computing Systems (tentative)

Robust Resource Allocation in Parallel and Distributed Computing Systems (tentative) Robust Resource Allocatio i Parallel ad Distributed Computig Systems (tetative) Ph.D. cadidate V. Shestak Colorado State Uiversity Electrical ad Computer Egieerig Departmet Fort Collis, Colorado, USA shestak@colostate.edu

More information

A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem

A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem A Novel Geetic Algorithm usig Helper Objectives for the 0-1 Kapsack Problem Ju He, Feidu He ad Hogbi Dog 1 arxiv:1404.0868v1 [cs.ne] 3 Apr 2014 Abstract The 0-1 kapsack problem is a well-kow combiatorial

More information

An Alternative Scaling Factor In Broyden s Class Methods for Unconstrained Optimization

An Alternative Scaling Factor In Broyden s Class Methods for Unconstrained Optimization Joural of Mathematics ad Statistics 6 (): 63-67, 00 ISSN 549-3644 00 Sciece Publicatios A Alterative Scalig Factor I Broyde s Class Methods for Ucostraied Optimizatio Muhammad Fauzi bi Embog, Mustafa bi

More information

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314

More information