Chapter 8. Replacement Theory. Babita Goyal. Replacement theory, time value of money, sudden failure, group replacement,

Size: px
Start display at page:

Download "Chapter 8. Replacement Theory. Babita Goyal. Replacement theory, time value of money, sudden failure, group replacement,"

Transcription

1 Chapter 8 Replacemet Theory Babita Goyal Key words: Replacemet theory, time value of moey, sudde failure, group replacemet, mortality ad prevetive replacemet. Suggested readigs:. Gupta P.K. ad Moha M. (987), Operatios Research ad Statistical Aalysis, Sulta Chad ad Sos, Delhi.. Johso R.D. ad Berard R.S. (977), Quatitative Techiques for Busiess Decisios, Pretice hall of Idia Private Limited 3. Swarup K., Gupta P.K. ad Moha M. (), Operatios Research, Sulta Chad ad Sos, Delhi. 49

2 8. Itroductio The study of replacemet is cocered with the situatios that arise whe some items such as equipmet eed replacemet due to chages i their performace. This chage may either be gradual or all of a sudde. Broadly speaig, the requiremet of a replacemet may be i ay of the followig situatios: (i) (ii) (iii) (iv) A item fails ad does ot wor at all or the item is expected to fail shortly. A item deteriorates ad eed expesive maiteace. A better desig of the equipmet is available. It is ecoomical to replace equipmet i aticipatio of costly failure. I this chapter, we are iterested i the first two situatios. Third situatio has bee dealt whe we studied the pay-off criteria. Whe studyig the problem of replacemet, we may or may ot cosider the time value of moey. 8. Replacemet of equipmet that deteriorates gradually Geerally, the cost of maiteace ad repairig of certai equipmets icreases with time ad ultimately the cost may become so high that it is more ecoomical to replace theses equipmets with ew oes. If the productivity of equipmet decreases with time, this may also be cosidered as a failure. At this poit a replacemet is justified. The costs associated with agig icrease at a icreasig rate whereas the resale value of the equipmet decreases at icreasig rate. The decreasig resale value results i icreasig depreciatio, which is the differece betwee the purchase price ad the resale value. The depreciatio of the item icreases at a decreasig rate. The optimal replacemet policy for such items is to replace the equipmet at a poit where the total cost curve itersects the total depreciatio curve 5

3 Costs Total depreciatio Total operatig cost Time to replace Time Fig. 8.(i) Average total cost Costs Average operatig cost Average depreciatio Time Fig. 8.(ii) (a) Time value of moey does ot chage If the value of moey does ot chage with time, the the user of the equipmet does ot eed to pay iterest o his ivestmets. We wish to determie the optimal time to replace the equipmet. We mae use of the followig otatios: C: Capital cost of the equipmet S: Scrap value of the equipmet 5

4 : Number of years that the equipmet would be i use. f( t): Maiteace cost fuctio. A ( ): Average total aual cost. Two possibilities are there (i) Time t is a cotiuous radom variable I this case the deterioratio of the equipmet is beig moitored cotiuously. The total cost of the equipmet durig years of use is give by TC Capital cost - Scrap value + Maiteace cost C - S + f( t) dt C - S A ( ) TC + f( tdt ) d For miimum cost, A ( ) d C - S - f( t) dt f( ) + C - S f( ) + f( t) dt A( ) d A( ) ad at f( ) A( ) d i.e., whe the maiteace cost becomes equal to the average aual cost, the decisio should be to replace the equipmet. (ii) Time t is a discrete radom variable I this case C - S A( ) TC + f( t ) A () is miimum whe 5

5 A ( + ) A ( ) ad A ( ) A ( ) or, A ( + ) A ( ) ad A ( ) A ( ) A( + ) A( ) C S f( t) f( ) A( ) t + A ( ) + f ( + ) A ( ) + + f( + ) A( ) Similarly A ( ) A ( ) f( ) A( ) Thus the optimal policy is Replace the equipmet at the ed of years if the maiteace cost i the (+) th year is more tha the average total cost i the th year ad the th year s maiteace cost is less tha previous year s average total cost. Example : A firm is cosiderig replacemet of a machie, whose cost price is Rs,,,, ad the scrap value is Rs.,. The ruig (maiteace ad operatig) costs of the machie are as follows: Table 8. Year Ruig cost (Rs.), 5, 8,, 8, 5, 3, 4, Whe should the machie be replaced? Sol: C S Rs.,, Rs., th f( ) Ruig cost i the year. 53

6 TC C - S + f ( t),, + f( t) We prepare the followig table Table 8. Year of service Ruig cost (Rs.) Cumulative ruig cost (Rs.) TC C - S + f ( t) A( ) T C () f() f ( ) (Rs.) (Rs.),,,,,, 5, 7,,7, 53,5 3 8, 5,,5, 38,334 4, 7,,7, 3,75 5 8, 45,,45, 9, 6 5, 7,,7, 8, ,,,,, 8, ,,4,,4, 3,5 Thus A (6) Rs. 8,334 is miimum. Hece replacemet should be doe after every sixth year. Example : A pritig machie costs Rs. 4, whe ew. The followig table gives the expected operatig costs, expected productio (per pages) ad the resale value of the machie Table 8.3 Age Operatig costs (Rs.) 5, 7, 8,,,5 5, Productio,, 9, 8, 5, 3,5 Resale value (Rs.) 3, 5, 9, 5,,, 54

7 The productio cost per uit of productio is Rs. 5. Fid the optimal replacemet policy. Sol: Table 8.4 (Rs.) Age Total O.C. Total productio cost Depreciatio Total cost Average cost 5,, 5, 5, 7, 5,,, 3 8, 5 5,, 44, , 3,, 6, 55 5,5 75 5,,, , 975 6,5,39, 367 The machie should be replaced after every years. Example 3: A factory ower fids from his past records that the costs per year of ruig a machie whose purchase price is Rs. 6, are as follows Table 8.5 Year Operatig costs (Rs.),, 4, 8, 3, 8, 34, Resale value (Rs.) 3, 5, 7,5 3,75,,, The ower has three machies, two of which are two-years old ad the third is oe year old. He is ow cosiderig a ew machie with 5% more capacity tha oe of the old oes. The price of this machie is Rs. 8,. The cost estimates for the ew machie are as follows Table 8.6 Year Operatig costs (Rs.), 5, 8, 4, 3, 4, 5, Resale value (Rs.) 4,,, 5, 3, 3, 3, 55

8 Assume that the loss of flexibility due to fewer machies is isigificat ad he has sufficiet wor i ay of the decisios, what should be the optimal policy? Sol: For the first type of trucs, the average aual costs ca be computed as follows Table 8.7 Age Total O.C. (Rs) Depreciatio (Rs.) Total cost (Rs) Average cost (Rs), 3, 4, 4,, 45, 67, 33,5 3 36, 5,5 88,5 9,5 4 54, 56,5,, , 58,,35, 7, 6,5, 58,,63, 767 7,39, 58,,97, 843 For the ew machie, the average aual cost has bee calculated i the followig schedule Table 8.8 Age Total O.C. (Rs) Total capital cost (Rs) (Total depreciatio) Total cost (Rs) Average cost (Rs), 4, 5, 5, 7, 6, 87, 43,5 3 45, 7,,5, 38, , 75,,44, 36, 5,, 77,,77, 35,4 6,4, 77,,7, 3,67 7,9, 77,,67, 38,43 (i) If the first type of machies is opted, the replacemet should be after every five wees. (ii) If the secod type of machies is opted, the replacemet should be after every five wees. 56

9 (iii) Average aual cost of old machie Rs. 7, Average aual cost of ew machie Rs. 35,4 Equivalet cost of old machie 35,4 Rs. 3,6 3 Thus old machies should be replaced by ew oes. (iv) Three old machies are to be replaced by two ew machies whe the joit ruig cost of the old machies is more the the average yearly cost of two ew machies (i.e., 35, 4 Rs. 7,8 ). The total cost of old machies is calculated below Year Table 8.9 Total aual cost of oe old machie (Rs.) Total aual cost of three give old machie (Rs.) 4, 67,-4, 7, 3,5,5 + 7, 7, 4,75 65, 5 4,75 7,5 The old machies must be replaced by ew machies two years from ow. (b) Time value of moey chages I this case, the ivestor is payig iterest o the moey that has bee ivested. We assume that (i) (ii) The maiteace costs are icurred at the begiig of time periods; ad The maiteace costs icrease with time. Let the moey carry a iterest rate of r% per year, i.e., oe rupee i years time is equivalet to Rs. (+r) - today. 57

10 (+r) - is called the preset worth factor of rupee oe spet years after ow. (+r) is the paymet compoud amout factor of rupee oe spet i years time. Let C: Iitial cost of the equipmet R : Ruig cost of the equipmet i year. ν : Rate of iterest ( + r) - V : Future discouted costs associated with the policy of replacig the equipmet at the ed of each years. The the preset value of V is {( ) ν ν... ν } V C+ R + R + R + + R + + {( C R) ν ν R+ ν R+... ν R } C+ ν R ( ν ) C+ ν R ν Now, V is miimum whe V V ad V + V Now, C+ ν R V+ V V + ν ν ( R ( ν) V ) ν + Similarly, V ν ( R ( ν) V ) V 58 ν

11 Now, ν <, ν beig depreciatio factor, ν > ν > + ν ( ν ) ( ) ( ν ) V V > R > V + ( ν ) ad V V > R < V R < V < R C+ R + νr+ ν R ν R R < W < R + ν + ν ν The expressio, which lies betwee R ad R is called the weighted average cost of all the previous years with weights beig, ν, ν,...ad ν respectively. Thus the optimal replacemet policy is: (a) Do ot replace the equipmet if the ext period s operatig cost is less tha the weighted average of previous costs. (b) Replace the equipmet if the ext period s operatig cost is greater tha the weighted average of previous costs. For ν, R < V < R Example 4: A maufacturer is to mae a choice betwee two machies, say, A ad B, which are priced at Rs. 5, ad Rs. 5, respectively. The aual ruig costs for machie A are Rs. 8, for first five years after which the costs icrease per year by Rs.,. Machie B, which has the same capacity as the machie A, will have a ruig cost of Rs., for first six years, ad after that would icrease by Rs., per year. If the moey is worth % per year, which machie should be purchased? Assume that the scrap value of the two machies is il. 59

12 Sol: r. ν We prepare the followig tables: Table 8.: For machie A Year () R ν ν R C + ν R ν W Table 8.: For machie B Year () R ν ν R C + ν R ν W

13 For machie A, the ruig cost i the ith year of operatios is the least so it should be replaced after every te years. For machie B, the ruig cost i the eighth year of operatios is the least so it should be replaced after every eight years. Further the weighted average cost i te years of machie A is Rs , whereas the weighted average cost i eight years of machie B is Rs So machie B should be purchased. 8.3 Replacemet of equipmets that fail suddely Sice the exact failure time is difficult to predict for those equipmets, which fail suddely, i such cases we try to obtai the probability distributio of failures. It is assumed that the failures occur at the ed of the period, say, t. The the objective is to determie the value of t that miimizes the total cost ivolved i the replacemet. I this case, two types of replacemet are ivolved. I first replacemet, equipmet is replaced as ad whe it fails. I secod type of replacemet, equipmet may be replaced eve before it fails. This id of replacemet is udertae i those situatios whe failure of equipmet results i huge moetary losses (e.g. electricity trasformers) or is fatal i ature (e.g. a pace maer). We defie the followig replacemet policies Idividual replacemet policy: A item is replaced immediately after its failure. This policy is called as the idividual replacemet policy Group replacemet policy: Uder this policy, decisios are tae as to whe the items must be replaced irrespective of the fact that the items have failed or have ot failed, with a provisio that if ay item fails before the optimal time, it may be idividually replaced. For example, electricity bulbs o a 6

14 road are replaced after some time eve if they have ot failed. But a idividual failed bulb is replaced durig the iterval betwee two successive group replacemets also. We defie the followig otatios: M ( t) the umber of survivors at ay time t. N iitial umber of items. pt ( ) P( of failure durig the time-period t) Mt ( ) Mt ( ) Mt ( ) p ( t) P( of survival till time-poit t) s Mt () N We have the followig results: Theorem 8.: (Mortality) A large populatio is subject to a give mortality law for a very log period of time. All deaths are immediately replaced by births ad there are o immigratios or emigratios. The the age distributio ultimately becomes stable ad the umber of deaths per uit time becomes costat, which is give by the size of the total populatio divided by the mea age of deaths. Proof: Let the maximum period of survival is Defie f ( t) umber of births at time t; px ( ) P(of daeth at time x). The Ad x px ( ) E(deaths till time t) f( t x) p( x) f( t+ ) x Now, f( t+ ) f( t x) p( x) (8.) x 6

15 t This is a differece equatio i t. To fid a solutio to this equatio, put f() t Aα, where A is a arbitrary costat ad α is a umber betwee ad. t+ t x Aα Aα p( x) x t t t ( α () α ()... α ( )) A p + p + + p t+ t t t α α p() + α p() α p( ) + Let t. The α α p() α p()... p( ) (8.) This is a liear homogeous equatio of degree + so it must have + roots. For α, L.H.S. of (8.) R.H.S. so is oe of the roots of the equatio. Let the other roots be α, α,..., α. The a geeral solutio to (8.) is give by f( t) A + Aα Aα t t t where A i 's are arbitrary costats to be determied. Also α < α i < i. Lettig t, we have lim f ( t) A t Now, our job is to determie A. For this, defie qx ( ) P(survival upto xor more years of age) P(death before age x) x pt ( ). t Obviously, q () Sice births are immediately replaced by deaths, i.e., A is the log ru umber of births as well as the umber of deaths, so we have 63

16 E(survivals upto age x) A q( x) N A q( x) A x x N qx ( ) Fially, we have to determie the deomiator of this expressio. For this, cosider x ( x+ ) x; ad The we have b f( x) hx ( ) f( b+ ) hb ( + ) f( aha ) ( ) hx ( + ) f( x) x a x a b qx ( ) qx ( ) x x x ( + ) q( + ) q() ( x+ ) q( x) x ( + ) q( + ) ( x+ ) q( x) x But, q ( + ) pi ( ) i Ad qx () qx ( + ) qx () px () qx ( ) ( + ) q ( + ) ( x+ )( px ( )) x x ( x+ ) p( x) x Mea age at death N Hece, we have A Mea age at death Hece the result. 64

17 Example 5: A compay maufactures automobile batteries at a cost of Rs. each. Battery life is subject to the followig mortality schedule Table 8.3 Age (moths) Probability of failure i Age (moths) Probability of failure (i) ext moth (p i ) (i) i ext moth (p i ) The compay has a guaratee policy uder which if a battery fails durig the first moth after purchase, either a refud of the full price or a ew battery is made; if it fails durig the secod moth, a refud of 9/3 of the full price is made; durig third moth, this refud is 8/3 of the full price ad so o util 3 th moth whe the refud is /3 of the full price. At what uit price should the batteries be sold so that o average will the compay brea-eve? Sol: Let the brea-eve price is Rs. P per battery ad 65

18 st p P(a ew battery fails durig the i+ moth) i The average refud o the failed batteries is give by 9 8 p+ p + p p3 P.98P The brea-eve price P is the sum of the expected refud ad the factory cost of the battery. Therefore P +.98P.99 P P.99 Rs. Theorem 8.: (Group replacemet) Let all the items of a system be replaced after a time iterval t with the provisio that a idividual replacemets ca be made if ad whe ay item fails durig this time period. The the optimal policy of replacemet is (i) Group replacemet must be made at the ed of the t th time period if the cost of idividual replacemet for the period is greater tha the average cost per uit time period through the ed of t periods. (ii) Group replacemet must ot be made at the ed of period t if the cost of idividual replacemet at the ed of the period t - is less tha the average cost per uit time period through the ed of t periods. Proof: Let N Total umber of items i the system. C the cost of replacig a item i group. C the cost of replacig a item idividually. Ct ( ) Total cost fuctio of group replacemet after time period t. f ( t) Total umber of failuers durig time period t. 66

19 The, t Ct () NC+ C f( x) x Average cost of group replacemet per uit time durig a iterval of t uits is give by At ( ) Ct () t i NC + C f ( x) t t We wat to miimize Ct () t. I that case wheever Ct ( ) Ct ( ) ( ) ( ) ad Ct + > > Ct t t t+ t We replace all items after time t. Now, C( t + ) C( t) > t + t C f ( t) > C() t t C( t ) C( t) > t t C f ( t ) < C() t t tc f ( t ) < C ( t) < tc f ( t) t- t- NC or, tf ( t ) f ( x) < < tf ( t) f ( x) C x x Hece the optimal replacemet policy is (i) Group replacemet must be made at the ed of the t th time period if the cost of idividual replacemet for the period is greater tha the average cost per uit time period through the ed of t periods. (ii) Group replacemet must ot be made at the ed of period t if the cost of idividual replacemet at the ed of the period t - is less tha the average cost per uit time period through the ed of t periods. 67

20 Example 6: The followig failure rates have bee observed for a certai type of electroic equipmets i a digital system Table 8.4 Ed of the wee Probability of failure till date The cost of replacemet of a idividual failed compoet is Rs. 5. The decisio is made to replace all these compoets simultaeously at fixed itervals, ad to replace the idividual compoets as they fail i service. If the cost of group replacemet is Rs. 3 per uit, what is the best iterval betwee group replacemets? Sol: Let there be, compoets i use, i.e. N,. th p P( a compoets fails durig i wee) i ad N umber of replacemets at the ed of the wee, i,,...8. i We calculate N i as follows: Table 8.5 t Probability of failure till time t pi Ci C i N i i t N p N t i t , Thus N i oscillates till the system acquires a steady state. The expected life of the system is give by 68

21 Expected life 8 i ip i 4.6 wees. Expected umber of failures per wee cost of idividual replacemet 6 5 Rs. 7, For group replacemet Table 8.6 t Idividual replacemet N (t) Total cost of replacemet Average cost (Rs.) (idividual + group) (Rs.) N ( t ) The optimum iterval for group replacemet is 3 wees. The group replacemet cost for this iterval is less tha the idividual replacemet cost, so it is better to adopt group replacemet. Example 7: At t, all the items i a system are ew, each of which has a costat probability p of failure before the ed of the first moth of life ad a probability q ( -p) of failure before the ed of the secod moth. If all the items are replaced as they fail, show that the expected umber of failures f (x), at the ed of the moth x is give by N x+ f( x) ( ( q) ); x,, + q where N is the umber of items i the system. If the cost per uit of the idividual replacemet is C, ad the cost of group replacemet per item is C, fid the coditios uder which 69

22 (a) (b) A group replacemet policy at the ed of each moth is the most profitable; No group replacemet policy is better tha the idividual replacemet policy. Sol: Let N the umber of items expected to fail at the ed of the first moth N p N( q) N the umber of items expected to fail at the ed of the secod moth Nq+ Np Nq+ N( q) N( q+ q ) I geeral, N N q q q q 3 ( ( ) ) N N q+ N p N( q q q... ( q) ) q N( q q q... ( q) )( q) N( q q q... ( q) ) f x N q+ q q + + q 3 x ( ) (... ( ) ) lim f( x) x ( q) N + q x+ N + q Total umber of items i the system mea age is the steady-state expectatio. () For group replacemet policy at the ed of each moth, cost of replacemet is NC. () For group replacemet policy at the ed of every secod moth, cost of replacemet is NC + NpC average cost per moth NC + NpC 7

23 (3) Average life of a item p+ q +q NC cost of idividual replacemet + q (a) A group replacemet at the ed of the first moth will be better tha the idividual replacemet, if the total cost of the group replacemet is less tha the average mothly cost of the idividual replacemet, i.e. N( q) + NC < NC + q C < Cq + q For a group replacemet at the ed of the every secod moth, the total cost of total replacemet will be ( N + N ) C + NC N(- q+ q ) C + NC Average mothly cost of group replacemet N q+ q C + NC (- ) i.e., a group replacemet at the ed of the every secod moth will be better tha the idividual replacemet, if the total cost of the group replacemet is less tha the average mothly cost of the idividual replacemet, i.e. (- ) N q+ q C + NC < NC ( + q) or, C < q ( q) C ( + q) (b) For idividual replacemet policy to be better tha ay of the group replacemet policies, we must have C qc qc( q) ( + q) ( + q) > ad C > or, C C ( + q) + q < ad C < q q ( q) 7

24 T r + q + q But q < < q q ( q) C < + q C q 8.4 Prevetive replacemet If the cost of the failure of the equipmet is much more tha the cost of its replacemet, e.g. a pacemaer or a electroic chip i a aviatio system, the it is advisable to replace that equipmet before it fails. We ow derive the optimal replacemet policy for prevetive replacemet. C C R F Cost of replacemet. Cost of failure (icludig replacemet). T the radom variable deotig the life of the equipmet. F ( t) P( T t) P(the equipmet will ot fail till time poit t). T f( t) P(of failure i time period t T t). ( ) The F () t F ( t ) - f() t T T Suppose that the replacemet is made at the begiig of a iterval. Let the replacemet policy be to replace the equipmet after every period if the item has ot failed earlier, i.e., T r max t The the expected life of the equipmet is T t ( ) E( T ) tf ( t ) f ( t) + T F ( t ) I a iterval of legth, say, ω, the umber of equipmet required is ω. ET ( ) Thus the expected cost of replacemet is 7

25 ω ω ( FT ( t ) ) C F + FT ( t ) C R E( T ) E( T ) AC( T ) ( ) F ( t ) C + F ( t ) C T F T R E( T ) Where AC (T) is the average cost curve. The the T, which miimizes AC (T), is the optimal time to replace the equipmet. Example 8: A small compoet i a machie costs Rs. 5 ad it taes, o average, miutes to replace it. However, i miutes, the machie ca produce goods of worth Rs. 3. the probability of the failure of the compoet icreases with the usage so that after some time of usage, it is advisable to replace the compoet. The cost of the replacemet of the compoet is Rs. 5. The probability distributio of the failures is give i the followig table: Table 8.7 Wees f(t) Fid the optimal time to replace the compoet. Sol: C R Cost of replacemet Rs. 5. C F Cost of failure Rs.3 + Rs.5 Rs. 35. Table 8.8 Wees f(t) F T (t) F T (t-) (-f (t)) ( ) E (T) F ( t ) C + F ( t ) C R T F T AC( T ) The optimal time to replace the chip is at the begiig of the secod wee. 73

26 Problems. Followig data has bee collected from the records regardig the ruig cost of a machie priced at Rs. 6,,. Table 8.9 Year Operatig costs (Rs.),, 4, 5, 35, 5, 8, Resale value (Rs.) 4,,,65,,75,,5, 9, 6, 45, Determie the optimal time of replacemet.. The cost of a ew machie is Rs.,,. Compute the optimal time to replace whe the costs associated with the machie are give below: Table 8. Age (Years) 3 Operatig costs (Rs.) 5, 7, 9, Resale value (Rs.) 8, 65, 5, Assume that the repairs are made at the ed of a period oly if the machie is to be retaied ad ot ecessary if the machie is to be sold. Assume that the cost of capital is %. 3. A populatio of N idividuals is subject to a give mortality law per uit of time. The deaths are immediately replaced by births at the ed of the iterval. No idividual ca survive more tha r periods. Show that the distributio of the umber of deaths ultimately stabilizes to N Average life 4. Cosider the followig replacemet schedule of a compoet i a electroic gadget 74

27 Table 8. Hours i use Probability of failure The cost of the replacemet of the part is Rs. 5 whereas the failure would cost Rs. 3,. What should be the optimal replacemet policy? 5. A truc fleet ower ows 5 trucs. He has a policy of replacig a tire whe it is wor completely. This costs him Rs. 6, per tire. He has bee advised that the replacemet cost ca be reduced to Rs. 4,5 if he replaces tires periodically. The past data has revealed the followig replacemet schedule Table 8. Moths after replacemet Proportio of the tires wor-out What should be the optimal replacemet policy? 6. A pipelie is due for repairs. It will cost Rs.,, for repairs, which will last for 3 years. A alterative is to lay a ew pipelie, which ca wor for years. If the cost of moey is % ad there is o salvage value, what should be the decisio? 7. Let p (t) be the probability that a machie i a group of 3 machies would breadow i period t. The cost of repairig a broe machie is Rs.. Prevetive maiteace esures servicig of all the machies at the ed of T uits of time at a cost of Rs. 5 per machie. Fid the optimum T which would miimize the expected total cost per period of servicig give that.3 for t pt ( ) pt ( ) +. for t,3,....3 for t > 75

28 8. A research team is required to attai a stable level of 5 members. The service schedule of the members is give below Table 8.3 Year Percet resigatios at the ed of the year What should be the umber of recruitmets per year to maitai the required stregth? If the promotio requires at least 8 years of service, what is the average legth of the service after which a ew recruit ca expect promotio? 9. The maagemet of a large hotel is cosiderig the periodic replacemet of the light bulbs fitted i its rooms. There are 5 rooms i the hotel ad each roo has 6 bulbs. The curret policy is to replace the bulbs as ad whe they fail. Per uit cost of replacig failed bulbs is Rs... The ew policy ca cut the costs to up to Rs. 6.. The past data reveals the followig iformatio: Table 8.4 Moths of use Percet of bulbs failig by the ed of the moth What should be the optimal replacemet policy?. If the cost of capital is % per aum, which of the followig ivestmet plas should be opted Table 8.5 Details Pla A Pla B Iitial cost (Rs.),,,5, Salvage value after 5 years (Rs.),5,,8, Aual profit (Rs.) 5, 3, 76

Queueing theory and Replacement model

Queueing theory and Replacement model Queueig theory ad Replacemet model. Trucks at a sigle platform weigh-bridge arrive accordig to Poisso probability distributio. The time required to weigh the truck follows a expoetial probability distributio.

More information

Section 13.3 Area and the Definite Integral

Section 13.3 Area and the Definite Integral Sectio 3.3 Area ad the Defiite Itegral We ca easily fid areas of certai geometric figures usig well-kow formulas: However, it is t easy to fid the area of a regio with curved sides: METHOD: To evaluate

More information

ARITHMETIC PROGRESSIONS

ARITHMETIC PROGRESSIONS CHAPTER 5 ARITHMETIC PROGRESSIONS (A) Mai Cocepts ad Results A arithmetic progressio (AP) is a list of umbers i which each term is obtaied by addig a fixed umber d to the precedig term, except the first

More information

Precalculus MATH Sections 3.1, 3.2, 3.3. Exponential, Logistic and Logarithmic Functions

Precalculus MATH Sections 3.1, 3.2, 3.3. Exponential, Logistic and Logarithmic Functions Precalculus MATH 2412 Sectios 3.1, 3.2, 3.3 Epoetial, Logistic ad Logarithmic Fuctios Epoetial fuctios are used i umerous applicatios coverig may fields of study. They are probably the most importat group

More information

A New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem

A New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem This is the Pre-Published Versio. A New Solutio Method for the Fiite-Horizo Discrete-Time EOQ Problem Chug-Lu Li Departmet of Logistics The Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog Phoe: +852-2766-7410

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

Section 6.4: Series. Section 6.4 Series 413

Section 6.4: Series. Section 6.4 Series 413 ectio 64 eries 4 ectio 64: eries A couple decides to start a college fud for their daughter They pla to ivest $50 i the fud each moth The fud pays 6% aual iterest, compouded mothly How much moey will they

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

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

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

Data Analysis and Statistical Methods Statistics 651

Data Analysis and Statistical Methods Statistics 651 Data Aalysis ad Statistical Methods Statistics 651 http://www.stat.tamu.edu/~suhasii/teachig.html Suhasii Subba Rao Review of testig: Example The admistrator of a ursig home wats to do a time ad motio

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

( θ. sup θ Θ f X (x θ) = L. sup Pr (Λ (X) < c) = α. x : Λ (x) = sup θ H 0. sup θ Θ f X (x θ) = ) < c. NH : θ 1 = θ 2 against AH : θ 1 θ 2

( θ. sup θ Θ f X (x θ) = L. sup Pr (Λ (X) < c) = α. x : Λ (x) = sup θ H 0. sup θ Θ f X (x θ) = ) < c. NH : θ 1 = θ 2 against AH : θ 1 θ 2 82 CHAPTER 4. MAXIMUM IKEIHOOD ESTIMATION Defiitio: et X be a radom sample with joit p.m/d.f. f X x θ. The geeralised likelihood ratio test g.l.r.t. of the NH : θ H 0 agaist the alterative AH : θ H 1,

More information

Time-Domain Representations of LTI Systems

Time-Domain Representations of LTI Systems 2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable

More information

GRADE 11 NOVEMBER 2012 MATHEMATICS P1

GRADE 11 NOVEMBER 2012 MATHEMATICS P1 Provice of the EASTERN CAPE EDUCATION NATIONAL SENIOR CERTIFICATE GRADE 11 NOVEMBER 01 MATHEMATICS P1 MARKS: 150 TIME: 3 hours This questio paper cosists of 14 pages, icludig a iformatio sheet ad a page

More information

Compound Interest. S.Y.Tan. Compound Interest

Compound Interest. S.Y.Tan. Compound Interest Compoud Iterest S.Y.Ta Compoud Iterest The yield of simple iterest is costat all throughout the ivestmet or loa term. =2000 r = 0% = 0. t = year =? I =? = 2000 (+ (0.)()) = 3200 I = - = 3200-2000 = 200

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should be doe

More information

SINGLE-CHANNEL QUEUING PROBLEMS APPROACH

SINGLE-CHANNEL QUEUING PROBLEMS APPROACH SINGLE-CHANNEL QUEUING ROBLEMS AROACH Abdurrzzag TAMTAM, Doctoral Degree rogramme () Dept. of Telecommuicatios, FEEC, BUT E-mail: xtamta@stud.feec.vutbr.cz Supervised by: Dr. Karol Molár ABSTRACT The paper

More information

Noah Williams Economics 312. University of Wisconsin Spring Midterm Examination Solutions 1 FOR GRADUATE STUDENTS ONLY

Noah Williams Economics 312. University of Wisconsin Spring Midterm Examination Solutions 1 FOR GRADUATE STUDENTS ONLY Noah Williams Ecoomics 32 Departmet of Ecoomics Macroecoomics Uiversity of Wiscosi Sprig 204 Midterm Examiatio Solutios FOR GRADUATE STUDENTS ONLY Istructios: This is a 75 miute examiatio worth 00 total

More information

ARITHMETIC PROGRESSION

ARITHMETIC PROGRESSION CHAPTER 5 ARITHMETIC PROGRESSION Poits to Remember :. A sequece is a arragemet of umbers or objects i a defiite order.. A sequece a, a, a 3,..., a,... is called a Arithmetic Progressio (A.P) if there exists

More information

Simulation. Two Rule For Inverting A Distribution Function

Simulation. Two Rule For Inverting A Distribution Function Simulatio Two Rule For Ivertig A Distributio Fuctio Rule 1. If F(x) = u is costat o a iterval [x 1, x 2 ), the the uiform value u is mapped oto x 2 through the iversio process. Rule 2. If there is a jump

More information

Stat 421-SP2012 Interval Estimation Section

Stat 421-SP2012 Interval Estimation Section Stat 41-SP01 Iterval Estimatio Sectio 11.1-11. We ow uderstad (Chapter 10) how to fid poit estimators of a ukow parameter. o However, a poit estimate does ot provide ay iformatio about the ucertaity (possible

More information

DEPARTMENT OF ACTUARIAL STUDIES RESEARCH PAPER SERIES

DEPARTMENT OF ACTUARIAL STUDIES RESEARCH PAPER SERIES DEPARTMENT OF ACTUARIAL STUDIES RESEARCH PAPER SERIES Icreasig ad Decreasig Auities ad Time Reversal by Jim Farmer Jim.Farmer@mq.edu.au Research Paper No. 2000/02 November 2000 Divisio of Ecoomic ad Fiacial

More information

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA, 016 MODULE : Statistical Iferece Time allowed: Three hours Cadidates should aswer FIVE questios. All questios carry equal marks. The umber

More information

Output Analysis and Run-Length Control

Output Analysis and Run-Length Control IEOR E4703: Mote Carlo Simulatio Columbia Uiversity c 2017 by Marti Haugh Output Aalysis ad Ru-Legth Cotrol I these otes we describe how the Cetral Limit Theorem ca be used to costruct approximate (1 α%

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

There is no straightforward approach for choosing the warmup period l.

There is no straightforward approach for choosing the warmup period l. B. Maddah INDE 504 Discrete-Evet Simulatio Output Aalysis () Statistical Aalysis for Steady-State Parameters I a otermiatig simulatio, the iterest is i estimatig the log ru steady state measures of performace.

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

A queueing system can be described as customers arriving for service, waiting for service if it is not immediate, and if having waited for service,

A queueing system can be described as customers arriving for service, waiting for service if it is not immediate, and if having waited for service, Queuig System A queueig system ca be described as customers arrivig for service, waitig for service if it is ot immediate, ad if havig waited for service, leavig the service after beig served. The basic

More information

Areas and Distances. We can easily find areas of certain geometric figures using well-known formulas:

Areas and Distances. We can easily find areas of certain geometric figures using well-known formulas: Areas ad Distaces We ca easily fid areas of certai geometric figures usig well-kow formulas: However, it is t easy to fid the area of a regio with curved sides: METHOD: To evaluate the area of the regio

More information

Reliability and Availablity

Reliability and Availablity Reliability ad Availablity This set of otes is a combiatio of material from Prof. Doug Carmichael's otes for 13.21 ad Chapter 8 of Egieerig Statistics Hadbook. NIST/SEMATECH e-hadbook of Statistical Methods,

More information

CORE MATHEMATICS PI Page 1 of 18 HILTON COLLEGE TRIAL EXAMINATION AUGUST 2014 CORE MATHEMATICS PAPER I GENERAL INSTRUCTIONS

CORE MATHEMATICS PI Page 1 of 18 HILTON COLLEGE TRIAL EXAMINATION AUGUST 2014 CORE MATHEMATICS PAPER I GENERAL INSTRUCTIONS CORE MATHEMATICS PI Page of 8 HILTON COLLEGE TRIAL EXAMINATION AUGUST 04 Time: hours CORE MATHEMATICS PAPER I GENERAL INSTRUCTIONS 50 marks PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY.. This questio

More information

SEQUENCE AND SERIES NCERT

SEQUENCE AND SERIES NCERT 9. Overview By a sequece, we mea a arragemet of umbers i a defiite order accordig to some rule. We deote the terms of a sequece by a, a,..., etc., the subscript deotes the positio of the term. I view of

More information

Simulation of Discrete Event Systems

Simulation of Discrete Event Systems Simulatio of Discrete Evet Systems Uit 9 Queueig Models Fall Witer 2014/2015 Uiv.-Prof. Dr.-Ig. Dipl.-Wirt.-Ig. Christopher M. Schlick Chair ad Istitute of Idustrial Egieerig ad Ergoomics RWTH Aache Uiversity

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Element sampling: Part 2

Element sampling: Part 2 Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

Section 7 Fundamentals of Sequences and Series

Section 7 Fundamentals of Sequences and Series ectio Fudametals of equeces ad eries. Defiitio ad examples of sequeces A sequece ca be thought of as a ifiite list of umbers. 0, -, -0, -, -0...,,,,,,. (iii),,,,... Defiitio: A sequece is a fuctio which

More information

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m? MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle

More information

3.1 & 3.2 SEQUENCES. Definition 3.1: A sequence is a function whose domain is the positive integers (=Z ++ )

3.1 & 3.2 SEQUENCES. Definition 3.1: A sequence is a function whose domain is the positive integers (=Z ++ ) 3. & 3. SEQUENCES Defiitio 3.: A sequece is a fuctio whose domai is the positive itegers (=Z ++ ) Examples:. f() = for Z ++ or, 4, 6, 8, 0,. a = +/ or, ½, / 3, ¼, 3. b = /² or, ¼, / 9, 4. c = ( ) + or

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES 9 SEQUENCES AND SERIES INTRODUCTION Sequeces have may importat applicatios i several spheres of huma activities Whe a collectio of objects is arraged i a defiite order such that it has a idetified first

More information

AP Statistics Review Ch. 8

AP Statistics Review Ch. 8 AP Statistics Review Ch. 8 Name 1. Each figure below displays the samplig distributio of a statistic used to estimate a parameter. The true value of the populatio parameter is marked o each samplig distributio.

More information

( ) = p and P( i = b) = q.

( ) = p and P( i = b) = q. MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of

More information

Properties and Hypothesis Testing

Properties and Hypothesis Testing Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.

More information

Sail into Summer with Math!

Sail into Summer with Math! Sail ito Summer with Math! For Studets Eterig Hoors Geometry This summer math booklet was developed to provide studets i kidergarte through the eighth grade a opportuity to review grade level math objectives

More information

1 Review of Probability & Statistics

1 Review of Probability & Statistics 1 Review of Probability & Statistics a. I a group of 000 people, it has bee reported that there are: 61 smokers 670 over 5 960 people who imbibe (drik alcohol) 86 smokers who imbibe 90 imbibers over 5

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

1 Inferential Methods for Correlation and Regression Analysis

1 Inferential Methods for Correlation and Regression Analysis 1 Iferetial Methods for Correlatio ad Regressio Aalysis I the chapter o Correlatio ad Regressio Aalysis tools for describig bivariate cotiuous data were itroduced. The sample Pearso Correlatio Coefficiet

More information

Chapter 8: Estimating with Confidence

Chapter 8: Estimating with Confidence Chapter 8: Estimatig with Cofidece Sectio 8.2 The Practice of Statistics, 4 th editio For AP* STARNES, YATES, MOORE Chapter 8 Estimatig with Cofidece 8.1 Cofidece Itervals: The Basics 8.2 8.3 Estimatig

More information

ENGI 4421 Confidence Intervals (Two Samples) Page 12-01

ENGI 4421 Confidence Intervals (Two Samples) Page 12-01 ENGI 44 Cofidece Itervals (Two Samples) Page -0 Two Sample Cofidece Iterval for a Differece i Populatio Meas [Navidi sectios 5.4-5.7; Devore chapter 9] From the cetral limit theorem, we kow that, for sufficietly

More information

Estimation for Complete Data

Estimation for Complete Data Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of

More information

ADVANCED SOFTWARE ENGINEERING

ADVANCED SOFTWARE ENGINEERING ADVANCED SOFTWARE ENGINEERING COMP 3705 Exercise Usage-based Testig ad Reliability Versio 1.0-040406 Departmet of Computer Ssciece Sada Narayaappa, Aeliese Adrews Versio 1.1-050405 Departmet of Commuicatio

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

More information

Inferential Statistics. Inference Process. Inferential Statistics and Probability a Holistic Approach. Inference Process.

Inferential Statistics. Inference Process. Inferential Statistics and Probability a Holistic Approach. Inference Process. Iferetial Statistics ad Probability a Holistic Approach Iferece Process Chapter 8 Poit Estimatio ad Cofidece Itervals This Course Material by Maurice Geraghty is licesed uder a Creative Commos Attributio-ShareAlike

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

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Polynomial Functions and Their Graphs

Polynomial Functions and Their Graphs Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively

More information

BIOS 4110: Introduction to Biostatistics. Breheny. Lab #9

BIOS 4110: Introduction to Biostatistics. Breheny. Lab #9 BIOS 4110: Itroductio to Biostatistics Brehey Lab #9 The Cetral Limit Theorem is very importat i the realm of statistics, ad today's lab will explore the applicatio of it i both categorical ad cotiuous

More information

Maximum and Minimum Values

Maximum and Minimum Values Sec 4.1 Maimum ad Miimum Values A. Absolute Maimum or Miimum / Etreme Values A fuctio Similarly, f has a Absolute Maimum at c if c f f has a Absolute Miimum at c if c f f for every poit i the domai. f

More information

Problem Set 4 Due Oct, 12

Problem Set 4 Due Oct, 12 EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios

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

MIXED REVIEW of Problem Solving

MIXED REVIEW of Problem Solving MIXED REVIEW of Problem Solvig STATE TEST PRACTICE classzoe.com Lessos 2.4 2.. MULTI-STEP PROBLEM A ball is dropped from a height of 2 feet. Each time the ball hits the groud, it bouces to 70% of its previous

More information

First come, first served (FCFS) Batch

First come, first served (FCFS) Batch Queuig Theory Prelimiaries A flow of customers comig towards the service facility forms a queue o accout of lack of capacity to serve them all at a time. RK Jaa Some Examples: Persos waitig at doctor s

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

ENG 209 Engineering Economy Lecture 5, Section 3.3 (Continue)

ENG 209 Engineering Economy Lecture 5, Section 3.3 (Continue) ENG 29 Egieerig Ecoomy Lecture 5, Sectio 3.3 (Cotiue) Equal-aymet-Series Sikig-Fud Factor, (F/, i, ) Give: Fid: i = the aual iterest rate. = the umber of iterest periods. F = the future amout. = paymet

More information

ECONOMIC OPERATION OF POWER SYSTEMS

ECONOMIC OPERATION OF POWER SYSTEMS ECOOMC OEATO OF OWE SYSTEMS TOUCTO Oe of the earliest applicatios of o-lie cetralized cotrol was to provide a cetral facility, to operate ecoomically, several geeratig plats supplyig the loads of the system.

More information

Math 105: Review for Final Exam, Part II - SOLUTIONS

Math 105: Review for Final Exam, Part II - SOLUTIONS Math 5: Review for Fial Exam, Part II - SOLUTIONS. Cosider the fuctio f(x) = x 3 lx o the iterval [/e, e ]. (a) Fid the x- ad y-coordiates of ay ad all local extrema ad classify each as a local maximum

More information

Castiel, Supernatural, Season 6, Episode 18

Castiel, Supernatural, Season 6, Episode 18 13 Differetial Equatios the aswer to your questio ca best be epressed as a series of partial differetial equatios... Castiel, Superatural, Seaso 6, Episode 18 A differetial equatio is a mathematical equatio

More information

GRADE 12 JUNE 2016 MATHEMATICS P1

GRADE 12 JUNE 2016 MATHEMATICS P1 NATIONAL SENIOR CERTIFICATE GRADE 1 JUNE 016 MATHEMATICS P1 MARKS: 150 TIME: 3 hours *MATHE1* This questio paper cosists of 14 pages, icludig a iformatio sheet. MATHEMATICS P1 (EC/JUNE 016) INSTRUCTIONS

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

INTRODUCTORY MATHEMATICAL ANALYSIS

INTRODUCTORY MATHEMATICAL ANALYSIS INTRODUCTORY MATHEMATICAL ANALYSIS For Busiess, Ecoomics, ad the Life ad Social Scieces Chapter 4 Itegratio 0 Pearso Educatio, Ic. Chapter 4: Itegratio Chapter Objectives To defie the differetial. To defie

More information

MATHEMATICS: PAPER III (LO 3 AND LO 4) PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY

MATHEMATICS: PAPER III (LO 3 AND LO 4) PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY NATIONAL SENIOR CERTIFICATE EXAMINATION EXEMPLAR 008 MATHEMATICS: PAPER III (LO 3 AND LO 4) Time: 3 hours 100 marks PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY 1. This questio paper cosists of 16

More information

Revision Topic 1: Number and algebra

Revision Topic 1: Number and algebra Revisio Topic : Number ad algebra Chapter : Number Differet types of umbers You eed to kow that there are differet types of umbers ad recogise which group a particular umber belogs to: Type of umber Symbol

More information

is also known as the general term of the sequence

is also known as the general term of the sequence Lesso : Sequeces ad Series Outlie Objectives: I ca determie whether a sequece has a patter. I ca determie whether a sequece ca be geeralized to fid a formula for the geeral term i the sequece. I ca determie

More information

The Poisson Distribution

The Poisson Distribution MATH 382 The Poisso Distributio Dr. Neal, WKU Oe of the importat distributios i probabilistic modelig is the Poisso Process X t that couts the umber of occurreces over a period of t uits of time. This

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

Mathematics: Paper 1

Mathematics: Paper 1 GRADE 1 EXAMINATION JULY 013 Mathematics: Paper 1 EXAMINER: Combied Paper MODERATORS: JE; RN; SS; AVDB TIME: 3 Hours TOTAL: 150 PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY 1. This questio paper cosists

More information

x = Pr ( X (n) βx ) =

x = Pr ( X (n) βx ) = Exercise 93 / page 45 The desity of a variable X i i 1 is fx α α a For α kow let say equal to α α > fx α α x α Pr X i x < x < Usig a Pivotal Quatity: x α 1 < x < α > x α 1 ad We solve i a similar way as

More information

AP Calculus AB 2006 Scoring Guidelines Form B

AP Calculus AB 2006 Scoring Guidelines Form B AP Calculus AB 6 Scorig Guidelies Form B The College Board: Coectig Studets to College Success The College Board is a ot-for-profit membership associatio whose missio is to coect studets to college success

More information

Generalized Semi- Markov Processes (GSMP)

Generalized Semi- Markov Processes (GSMP) Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual

More information

6. Uniform distribution mod 1

6. Uniform distribution mod 1 6. Uiform distributio mod 1 6.1 Uiform distributio ad Weyl s criterio Let x be a seuece of real umbers. We may decompose x as the sum of its iteger part [x ] = sup{m Z m x } (i.e. the largest iteger which

More information

MBACATÓLICA. Quantitative Methods. Faculdade de Ciências Económicas e Empresariais UNIVERSIDADE CATÓLICA PORTUGUESA 9. SAMPLING DISTRIBUTIONS

MBACATÓLICA. Quantitative Methods. Faculdade de Ciências Económicas e Empresariais UNIVERSIDADE CATÓLICA PORTUGUESA 9. SAMPLING DISTRIBUTIONS MBACATÓLICA Quatitative Methods Miguel Gouveia Mauel Leite Moteiro Faculdade de Ciêcias Ecoómicas e Empresariais UNIVERSIDADE CATÓLICA PORTUGUESA 9. SAMPLING DISTRIBUTIONS MBACatólica 006/07 Métodos Quatitativos

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

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

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

Lecture 9: Hierarchy Theorems

Lecture 9: Hierarchy Theorems IAS/PCMI Summer Sessio 2000 Clay Mathematics Udergraduate Program Basic Course o Computatioal Complexity Lecture 9: Hierarchy Theorems David Mix Barrigto ad Alexis Maciel July 27, 2000 Most of this lecture

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY

UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY Structure 2.1 Itroductio Objectives 2.2 Relative Frequecy Approach ad Statistical Probability 2. Problems Based o Relative Frequecy 2.4 Subjective Approach

More information

Math 10A final exam, December 16, 2016

Math 10A final exam, December 16, 2016 Please put away all books, calculators, cell phoes ad other devices. You may cosult a sigle two-sided sheet of otes. Please write carefully ad clearly, USING WORDS (ot just symbols). Remember that the

More information

Chapter 7: The z-transform. Chih-Wei Liu

Chapter 7: The z-transform. Chih-Wei Liu Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability

More information

John Riley 30 August 2016

John Riley 30 August 2016 Joh Riley 3 August 6 Basic mathematics of ecoomic models Fuctios ad derivatives Limit of a fuctio Cotiuity 3 Level ad superlevel sets 3 4 Cost fuctio ad margial cost 4 5 Derivative of a fuctio 5 6 Higher

More information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l SRC Techical Note 1997-011 Jue 17, 1997 Tight Thresholds for The Pure Literal Rule Michael Mitzemacher d i g i t a l Systems Research Ceter 130 Lytto Aveue Palo Alto, Califoria 94301 http://www.research.digital.com/src/

More information

HOMEWORK #10 SOLUTIONS

HOMEWORK #10 SOLUTIONS Math 33 - Aalysis I Sprig 29 HOMEWORK # SOLUTIONS () Prove that the fuctio f(x) = x 3 is (Riema) itegrable o [, ] ad show that x 3 dx = 4. (Without usig formulae for itegratio that you leart i previous

More information

Expectation and Variance of a random variable

Expectation and Variance of a random variable Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio

More information

Exponential and Trigonometric Functions Lesson #1

Exponential and Trigonometric Functions Lesson #1 Epoetial ad Trigoometric Fuctios Lesso # Itroductio To Epoetial Fuctios Cosider a populatio of 00 mice which is growig uder plague coditios. If the mouse populatio doubles each week we ca costruct a table

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