Inventory Management Under Random Supply Disruptions and Partial Backorders

Size: px
Start display at page:

Download "Inventory Management Under Random Supply Disruptions and Partial Backorders"

Transcription

1 Inventory Mngement Under Rndom Supply Disruptions nd Prtil Bckorders Antonio Arreol-Ris, 1 Gregory A. DeCroix 2 1 Deprtment of Informtion & Opertions Mngement, Lowry Mys College & Grdute School of Business, Texs A&M University, College Sttion, Texs Fuqu School of Business Duke University, Durhm, North Crolin Received June 1997; revised Mrch 1998; ccepted 30 Mrch 1998 Abstrct: We explore the mngement of inventory for stochstic-demnd systems, where the product s supply is rndomly disrupted for periods of rndom durtion, nd demnds tht rrive when the inventory system is temporrily out of stock become mix of bckorders nd lost sles. The stock is mnged ccording to the following modified (s, S) policy: If the inventory level is t or below s nd the supply is vilble, plce n order to bring the inventory level up to S. Our nlysis yields the optiml vlues of the policy prmeters, nd provides insight into the optiml inventory strtegy when there re chnges in the severity of supply disruptions or in the behvior of unfilled demnds John Wiley & Sons, Inc. Nvl Reserch Logistics 45: , INTRODUCTION We consider stochstic-demnd inventory system where the product s supply is rndomly disrupted for periods of rndom durtion. The source of supply disruptions could be process-relted or mrket-relted. In the first cse, the supply my become unvilble due to brekdowns, trnsporttion disruptions, or strike. In the second cse, even though the goods my be physiclly vilble, mrket conditions my be such tht prticulr compny does not hve ccess to the product. One exmple of such conditions my rise s result of price fluctutions, where, during certin periods of time, the price t which supply equls demnd is so high tht purchsing the product becomes prohibitive for some compnies. Another exmple is scrcity of goods where the supplier gives preference to mjor plyers t the expense of minor plyers. The uthors re fmilir with compny tht fces this sitution. For excellent motivtions of inventory systems with rndom supply disruptions, see Prlr nd Berkin [18] nd Gupt [8]. Customers tht encounter stockout my decide to bckorder or my become lost sle. Most work in inventory mngement hs considered one of the two extremes of customers behvior during stockouts: All customers bckorder or ll customers re lost. In this pper we consider more generl stockout behvior, commonly clled prtil bckorders, where Correspondence to: T. Arreol-Ris 1998 by John Wiley & Sons, Inc. CCC X/98/ / 8m27$$ :11:55 nr W: Nv Res 994

2 688 Nvl Reserch Logistics, Vol. 45 ( 1998) frction of demnds tht rrive during stockout is bckordered nd the remining frction is lost. The costs of mnging the system re sttionry, nd include ordering, holding, lost sles, nd bckordering costs. The system is controlled ccording to the following modified (s, S) policy: When the inventory level is t or below s nd the supply is vilble, procure the necessry mount to bring the inventory level up to S. This modified (s, S) policy ws dopted for severl resons. The optiml policy for the inventory system under study is n open reserch question. In the bsence of supply disruptions, the proposed policy becomes the stndrd (s, S) policy which is known to be optiml for this sitution. Plcing orders when the inventory level is t or below the reorder point nd the supply is vilble nturlly modifies the stndrd ( s, S) policy to ccommodte supply disruptions. For the inventory system under considertion, we first derive the cost function nd use it to determine the optiml vlues of the policy prmeters (s, S). Then we explore the impct on the optiml vlues of the policy prmeters of vritions in the verge frequency nd durtion of supply disruptions, nd of vritions in the frction of stockouts tht re bckordered. We use the results of this nlysis to obtin insights into the optiml strtegy for using the policy prmeters s nd S to protect the system ginst supply disruptions with different levels of severity, nd lso to exmine the effect of different stockout behviors on this optiml strtegy. Due to the difficulty of hndling prtil bckorders, the inventory literture in this re is limited. Moinzdeh [ 12] considers bse-stock level inventory system with Poisson demnd, constnt resupply times, nd prtil bckorders. Other inventory models with prtil bckorders cn be found in Montgomery et l. [15], Kim nd Prk [10], nd Posner nd Ynsouni [22]. Tretment of supply uncertinty in production-inventory system cn be trced to Meyer et l. [ 11], which studied single-stge production system fcing constnt demnd where the supply source is subject to rndom filure. The uthors ssumed zero setup cost nd pure lost sles, nd developed expressions for the operting chrcteristics of the system. Other work on production-inventory systems with deterministic demnd nd supply disruptions includes [1], [4], [5], [6], [7], nd [14]. Prlr nd Berkin [ 18] study the clssic EOQ problem with supply disruptions. Prlr nd Perry [19] extend this nlysis to system where orders my be plced before the inventory level reches zero, nd where there is fixed cost for determining the stte of the supplier. Weiss nd Rosenthl [ 25] determine the optiml inventory policy when the timing (but not the durtion) of supply disruptions is known in dvnce. Prlr nd Perry [ 20] consider system with two suppliers subject to independent disruptions. To our knowledge, the only ppers deling with supply disruptions nd rndom demnd re [2], [3], [8], [17], [21], nd [23]. Posner nd Berg [21] extend Meyer et l. [11] to the cse of compound Poisson demnd. Cho [2] presents model in which the rte of inventory ccumultion or reduction cn be continuously djusted. Under liner cost structure the uthor chrcterizes the optiml control policy using single inventory trget. Cho et l. [3] present very generl model for mnging fuel inventories t electric utilities, nd describe solution procedures involving dynmic progrmming nd simultion. Relted work cn be found in [13] nd [16]. The work most similr to tht presented here is contined in Gupt [8], Prlr [17], nd Song nd Zipkin [23]. One of the models presented in Song nd Zipkin is essentilly periodic-review version of our model, with the dditionl ssumption of complete bckordering. In tht setting, the uthors show tht policy equivlent to our modified (s, S) policy / 8m27$$ :11:55 nr W: Nv Res 994

3 Arreol-Ris nd DeCroix: Inventory Mngement with Supply Disruptions 689 is optiml, thus providing further motivtion for our policy choice. Prlr presents model similr to ours, with positive delivery led times nd more generl ssumptions regrding the frequency nd durtion of disruptions, but with the more restrictive ssumption of full bckordering. The uthor derives n pproximte cost function nd demonstrtes solution procedure for the specil cse when order quntities re lrge. Gupt studies model with demnd nd disruption ssumptions similr to those considered here. His model is more restrictive in tht it ssumes tht ll shortges result in lost sles, but more generl since it llows for positive delivery led times. In ddition, Gupt proposes using stndrd ( r, Q) policy, which my result in plcing multiple orders during supply disruption. The unnecessry ordering costs resulting from such policy mke it generlly inferior to the modified ( s, S) policy proposed here. In light of the previous work on inventory systems with supply disruptions, this pper mkes number of primry contributions. First, it is the only work to ddress the problem of mnging stochstic-demnd system with both supply disruptions nd prtil bckorders. Since the qulittive behvior of the model presented here remins intct for the extreme cses of full bckordering nd pure lost sles, our work subsumes those versions of previous models tht gree with our ssumptions. It thus provides unified tretment of some of the models considered by Song nd Zipkin [23], Prlr [17], nd Gupt [8]. In ddition, we obtin exct closed-form expressions for the system costs. Bsed on these expressions, we re ble to develop relible solution procedures nd extrct vluble insights into the behvior of the system. In prticulr, our nlysis provides guidnce to mngers regrding the best strtegy to use for protection ginst chnges in the severity of supply disruptions or chnges in the behvior of unfilled demnds. The contents of the pper re orgnized s follows. Section 2 dels with model development nd nlysis. The section includes derivtion of the cost function nd determintion of the optiml vlues of the policy prmeters. Sections 3 nd 4 respectively ddress the optiml inventory strtegy when there re chnges in the severity of supply disruptions nd in the stockout behvior. The lst section summrizes our reserch findings nd offers directions for future reserch. 2. MODEL DEVELOPMENT AND ANALYSIS Let D denote demnd per unit time, I denote the interrrivl time of supply disruptions, nd L denote the length of supply disruptions. We ssume tht D is Poisson process with prmeter, nd tht I nd L re exponentilly distributed with prmeters l nd m, respectively. Thus represents verge demnd per unit time, 1/ l represents verge time between supply disruptions, nd 1/ m represents verge durtion of supply disruptions. In our experience with systems fcing supply disruptions, the delivery led time fter n order is plced tends to be smll compred to the verge length of supply disruption. To reflect this, nd to simplify the nlysis, our model ssumes tht delivery led times re zero. Since zero led times result in never hving orders outstnding, the modified (s, S) inventory policy cn be implemented bsed on the inventory level rther thn the more trditionl inventory position. We will use the following nottion nd definitions. N Å long-run verge number of orders plced per unit time, OH Å long-run verge on-hnd inventory level, q Å probbility tht stockout becomes bckorder, / 8m27$$ :11:55 nr W: Nv Res 994

4 690 Nvl Reserch Logistics, Vol. 45 ( 1998) 1 0 q Å probbility tht stockout becomes lost sle, LS Å long-run verge number of lost sles per unit time, BR Å long-run verge number of units bckordered per unit time, BL Å long-run verge bckorder level, k Å ordering cost, h Å holding cost rte, p Å unit lost sles cost, p 0 Å unit bckordering cost, p 1 Å bckordering cost rte, K Å long-run verge totl cost per unit time. In nlyzing our modified (s, S) inventory policy, we will find it convenient to work with s nd D å S 0 s insted of s nd S. The policy prmeter D could be interpreted s the mount ordered if the supply is vilble when the inventory levels hits s or, lterntively, s the minimum quntity ordered Cost Function Since demnd for the product is Poisson process, we restrict s nd D to be integers. Nturlly D 1, nd following previous reserch in inventory theory, we ssume tht s 0. Let b denote the probbility of finding the supply unvilble when the inventory level hits s. The following proposition estblishes the fundmentl result of this section. PROPOSITION 1: In the inventory system under study K(s, D) Å N k / h D D / 1 2 / s / b m s 0 (1 0 r s ) m / r s bg m, N Å m md / b, nd b Å l D l / m 1 0 / l / m where r Å /( / m) nd g Å (1 0 q)p / q(p 0 / p 1 /m). All proofs re included in the Appendix. When no confusion rises, K will be used in lieu of K(s, D). Notice tht, in the limiting cse q r 0, the inventory system becomes one with pure lost sles nd g r p. In the limiting cse q r 1, the inventory system becomes one with full bckorders nd g r p 0 / p 1 /m which represents the expected cost per bckorder. Consequently, g cn be interpreted s the expected cost per demnd rriving during stockout. / 8m27$$ :11:55 nr W: Nv Res 994

5 Arreol-Ris nd DeCroix: Inventory Mngement with Supply Disruptions Optimiztion Results Let s* nd D* denote the optiml vlues of the policy prmeters. In this section we focus on finding s* nd D*. Define nd s*(d) Å rg min s 0 K(s, D) D*(s) Å rg min D 1 K(s, D). For ese of exposition, the following development ssumes tht s*(d) nd D*(s) re unique. If this is not the cse, the rguments involving unique s*(d) nd D*(s) cn be dpted by focusing on prticulr vlues of s*(d) nd D*(s), sy the smllest or the lrgest. PROPOSITION 2: For fixed vlue of D, K is convex in s. Moreover, if D b m 0ln(r) ú r 1 0 r h / gm h 0 1, then s*(d) Å 0; otherwise s*(d) Å ln(rb) ln(r) or s*(d) Å ln(rb) ln(r) where Å m2 D / bm 0b 2 ln(r) nd b Å h h / g. Proposition 2 estblishes tht K is convex in s for fixed D. However, lthough visul nlysis of numericl trils suggests tht K is in fct jointly convex in s nd D, we hve not been ble to verify this nlyticlly, or even to show tht K is convex in D for fixed s. As result, closed-form expression for D*(s) does not seem possible, nd thus we cnnot rule out potentil difficulties in computing s* nd D* if K is not well behved. Despite this possibility, we were ble to obtin some qulittive informtion regrding the behvior of s*(d) nd D*(s), s indicted in the following proposition. PROPOSITION 3: s*(d) is nonincresing in D nd D*(s) is nonincresing in s. / 8m27$$ :11:55 nr W: Nv Res 994

6 692 Nvl Reserch Logistics, Vol. 45 ( 1998) In ddition to providing insight into the behvior of the optiml policy prmeters, Proposition 3 llows us to estblish the finite convergence of Algorithm A below to the optiml pir (s*, D*). ALGORITHM A: 1. Perform line serch on D to compute D*(0). 2. For ech D {1,...,D*(0)}, compute s*(d) using Proposition Among the D*(0) pirs (s*(d), D) computed in Step 2, the one tht yields the smllest vlue of K is the optiml pir (s*, D*). 3. OPTIMAL INVENTORY STRATEGY FOR CHANGES IN THE SEVERITY OF SUPPLY DISRUPTIONS Given the complexity of s*, D*, nd K(s*, D*), our chrcteriztion of the optiml inventory strtegy s m or l chnges will be bsed on nlyticl results for limiting vlues of m nd l, nd on results of extensive numericl experiments for their nonlimiting vlues. In preprtion for the forthcoming nlysis, we will tke smll digression to discuss how the protection of the inventory system ginst supply disruptions cn be djusted by vrying the vlues of s, D, nd S. While it is obvious tht incresing s would increse the protection level of the system, nd decresing s would decrese the protection level of the system, it is less cler wht would be the effect on the protection level when D increses or decreses. Specificlly, incresing D reduces the number of cycles per yer nd hence decreses the number of times tht potentil supply disruption my be fced, which in turn increses the protection level. On the other hnd, it is esy to see from Proposition 1 tht incresing D increses b nd thus increses the probbility of encountering supply disruption when the inventory level hits s, which in turn decreses the protection level. The following proposition settles this dilemm. PROPOSITION 4: The frction of time tht the inventory system is incurring stockouts (lost sles or bckorders) is decresing in D. While the bove discussion mkes it cler tht incresing either s or D increses the system s protection ginst supply disruptions, it is not obvious to wht extent ech of these prmeters should be used to chieve such protection. For exmple, if n increse in the protection level is needed, should s be incresed, should D be incresed, should both be incresed, or should one be incresed nd one be decresed? In ddition, if n increse in protection level is needed, will the djustments in s nd D lwys result in lrger vlues of S? Given Proposition 3, which sttes tht ll else being equl, increses in s tend to yield decreses in D nd vice vers, one should not be surprised to lern tht the nswers to the bove questions re complex. The following two subsections go long wy towrd nswering these questions, nd provide significnt insight into the impct of supply disruptions on the inventory system being studied Chnges in m Consider the limiting cse m r 0. Using Eq. (13) in the Appendix, it is not hrd to demonstrte tht lim mr0 0 iå0 P(i, 1)Å 1. Thus for ny vlues of (s, D) ll demnds will / 8m27$$ :11:55 nr W: Nv Res 994

7 Arreol-Ris nd DeCroix: Inventory Mngement with Supply Disruptions 693 Figure 1. Optiml behvior of the inventory system s m vries: ( ) s*; ( ) D*; ( ) S*. be lost or bckordered. This indictes tht when the verge durtion of supply disruptions grows without bound, the product should not be inventoried. Consider now the limiting cse m r. Using Proposition 1, it is not difficult to show tht Hence, if m Å, then nd lim K Å k mr D / h(d / 1) 2 / hs. (1) s* Å 0 (2) D* Å 2k h or D* Å 2k h. (3) Therefore, s the verge durtion of supply disruptions goes to zero, the optiml behvior of the inventory system pproches tht of the bsic EOQ model. For nonlimiting vlues of m, to study the behvior of s*, D*, nd S* sm chnges, we formulted 128 test problems. These problems were generted by fixing h Å 1, nd then tking ll combintions of the following prmeter vlues: Å 100, 500; q Å 0.3, 0.7; k Å 50, 200; p Å 10, 50; p 0 Å 2, 5; p 1 Å 50, 200; l Å 1, 12. Bsed on the optimiztion results of Section 2.2, we solved ech of the 128 test problems for lrge number of vlues of m, nd produced grphs of s* vs. m, D* vs. m, nd S* vs. m. The behvior of s*, D*, nd S* sm chnges ws consistent cross ll test problems, nd this behvior is cptured by the exmple in Figure 1, where Å 100, q Å 0.3, k Å 50, h Å 1, p Å 10, p 0 Å 2, p 1 Å 50, l Å 1, nd EOQ Å 100. Note the following: / 8m27$$ :11:55 nr W: Nv Res 994

8 694 Nvl Reserch Logistics, Vol. 45 ( 1998) S*, s*, nd D* re decresing in m. As m r, s* r 0 nd D* r EOQ. The mngeril implictions of these reserch findings re severl. When the severity of the supply disruptions diminishes becuse m is incresing, less protection is needed, nd, s result, the optiml vlues of the policy prmeters should decrese. Conversely, when the severity of the supply disruptions increses becuse m is decresing, more protection is needed, nd the optiml vlues of the policy prmeters should increse. However, wht is not necessrily intuitive is tht, even though, by Proposition 3, s*(d) nd D*(s) tend to move in opposite directions, n increse in the system s protection level is best chieved by incresing both s* nd D*. With regrd to the second finding, we know from the nlyticl results in Eqs. (1) (3) tht, s m r, the limiting behvior of the system is tht of bsic EOQ system. Nevertheless, it is interesting to see tht in some circumstnces even for moderte vlues of m, the inventory system strts to exhibit EOQ behvior Chnges in l Consider the limiting cse l r 0. Using Proposition 1, it is not difficult to show tht lim lr0 K Å k D / h(d / 1) 2 / hs. (4) Compring (1) to (4), we conclude tht the results in (2) nd (3) pply here s well, nd hence when the verge time between supply disruptions goes to infinity, the optiml behvior of the inventory system lso becomes tht of the bsic EOQ model. Consider now the limiting cse l r. It is not hrd to demonstrte tht lim K lr Å m D(D / 1) / md / k h 2 / sd / m s 1 0 (1 0 r s ) m / r s g m. (5) As l r, the inventory system being studied pproches one where the supply is lwys unvilble t the time the inventory level hits s. As result, every ordering cycle experiences n exponentil inventory-replenishment time with men 1/m. However, since n order is not plced until the supply becomes vilble ( i.e., t the end of the inventory-replenishment time), this inventory system is distinctly different from clssicl inventory systems with exponentil inventory-replenishment times (see, for exmple, Hdley nd Whitin [9]). In prticulr, ech order lwys returns the on-hnd inventory to S, successive inventoryreplenishment times re clerly independent, nd orders cnnot cross. Using Eq. (5), it is not difficult to show tht, s l r, if D ú m 0ln(r) r 1 0 r h / gm h 0 1, then s*(d) Å 0; otherwise, / 8m27$$ :11:55 nr W: Nv Res 994

9 Arreol-Ris nd DeCroix: Inventory Mngement with Supply Disruptions 695 s*(d) Å ln(rb) ln(r) or s*(d) Å ln(rb) ln(r), (6) where Å m2 D / m 0 2 ln(r) (6b) nd b Å h h / g. (6c) Therefore, s the verge interrrivl time of supply disruptions goes to zero, s* nd D* clerly converge to finite vlues. These vlues cn be obtined using n obvious vrition of Algorithm A. We conducted second numericl experiment with two objectives. First, we sought to gin dditionl insight into the limiting behvior of s*, D*, nd S* sl r. Second, we wished to study, for nonlimiting vlues of l, the behvior of s*, D*, nd S* sl chnges. We formulted 128 test problems by fixing h Å 1, nd then tking ll combintions of the following prmeter vlues: Å 100, 500; q Å 0.3, 0.7; k Å 50, 200; p Å 10, 50; p 0 Å 2, 5; p 1 Å 50, 200; m Å 1, 12. Using the optimiztion results of Section 2.2, we then solved ech of the 128 test problems for lrge number of vlues of l, nd produced grphs of s* vs. l, D* vs. l, nd S* vs. l. Once more, the behvior of s*, D*, nd S* sl chnges ws consistent cross ll test problems, nd this behvior is cptured by the three exmples in Figure 2, where Å 100, q Å 0.3, k Å 50, h Å 1, p Å 10, p 0 Å 2, p 1 Å 50, m Å 1, 6, 12, nd EOQ Å 100. Note the following: S* is incresing in l. There exists lo ú 0 such tht, on l õ lo, s* Å 0 nd D* is incresing in l, nd, on l lo, s* is incresing in l nd D* is decresing in l. lo is incresing in m e.g., lo (m Å 1) Å 0.2, lo (m Å 6) Å 1.0, nd lo (m Å 12) Å 2.0. As l r 0, s* r 0 nd D* r EOQ. As l r, D* r EOQ nd s* r s* (D Å EOQ). Severl mngeril implictions cn be derived from the bove reserch findings. Not surprisingly, when the severity of the supply disruptions diminishes becuse l is decresing, S* should decrese; nd conversely, when the severity of the supply disruptions increses becuse l is incresing, S* should increse. A second impliction is definitely less intuitive: Depending on the vlue of l, the system follows two different strtegies to increse the protection level s l increses. When l [ 0, lo ), the increses in S* should be the result of incresing D* lone. When l [lo, ), the increses in S* should be the net result of incresing s* nd decresing D*. Note lso tht lo, the vlue of l tht triggers the chnge of strtegy from increse S* / 8m27$$ :11:55 nr W: Nv Res 994

10 696 Nvl Reserch Logistics, Vol. 45 ( 1998) Figure 2. Optiml behvior of the inventory system s l vries: ( ) s*; ( ) D*; ( ) S*. / 8m27$$ :11:55 nr W: Nv Res 994

11 Arreol-Ris nd DeCroix: Inventory Mngement with Supply Disruptions 697 solely by incresing D* to increse S* by incresing s* nd decresing D*, is ffected by m. The smller the vlue of m the sooner the strtegy shift. The finl finding bove is surprising nd, even with hindsight, difficult to explin: The finite vlue to which D* converges s l r is EOQ, nd, s result, the finite vlue to which s* converges is s* (D Å EOQ). We confess tht, from theoreticl stndpoint, we were even more surprised when ttempts to justify the behvior D* r EOQ s l r by using Eqs. (5) nd (6) were fruitless. 4. OPTIMAL INVENTORY STRATEGY FOR CHANGES IN STOCKOUT BEHAVIOR In this section we chrcterize the optiml inventory strtegy s stockout behvior chnges. The pproch used prllels tht of Section 3. To explore the response of the system to vrying moderte vlues of q, third extensive numericl experiment ws performed on 128 test problems. The test problems were formulted by fixing h Å 1, nd then tking ll combintions of the following prmeter vlues: Å 100, 500; k Å 50, 200; p Å 10, 50; p 0 Å 2, 5; p 1 Å 50, 200; l Å 1, 12; nd m Å 1, 12. Using the optimiztion results of Section 2.2, we solved ech of the 128 test problems for lrge number of vlues of q with 0 q 1, nd produced grphs of s*, D*, nd S* vs. q. The behvior of s*, D*, nd S* sq chnges ws consistent cross ll test problems, nd this behvior is cptured by the two exmples in Figure 3, where Å 500, k Å 50, h Å 1, p Å 50, p 0 Å 2, p 1 Å 200, l Å 1, nd m Å 1 (Exmple 1) nd 12 (Exmple 2). Hence for Exmple 1 we hve tht g Å 50 / 152q, nd for Exmple 2 we hve tht g Å q. Note the following: D* is nerly constnt in q. s* nds* re incresing/decresing in q when g is incresing/decresing in q. A number of mngeril implictions re suggested by these numericl results. First, since D* seems to be quite insensitive to the frction of stockouts tht re bckordered, the inventory mnger cn choose good minimum order quntity D without obtining precise estimte for q. This my be quite useful in prctice, since estimting q my be difficult. On relted vein, this result lso implies tht the vrying levels of protection ginst supply disruptions required by different stockout behviors re chieved lmost entirely by chnging the optiml reorder point s*. Finlly, the second reserch finding confirms our intuition tht, s stockout behvior shifts towrd more bckorders, more protection ginst supply disruptions is desirble when the expected cost per bckorder is greter thn the expected cost per lost sle, nd less protection ginst supply disruptions is desirble when the expected cost per bckorder is less thn the expected cost per lost sle. 5. CONCLUSION Our reserch interest in this pper hs been to explore the optiml mngement of inventory for stochstic-demnd systems with rndom supply disruptions nd prtil bckorders. Our results suggest the following mngeril insights: / 8m27$$ :11:55 nr W: Nv Res 994

12 698 Nvl Reserch Logistics, Vol. 45 ( 1998) Figure 3. Optiml behvior of the inventory system s q vries: ( ) s*; ( ) D*; ( ) S*. The optiml inventory strtegy to mnge chnge in the severity of supply disruptions should be to move the order-up-to level S* in the sme direction s the chnge. However, the specific strtegy to ccomplish such move in S* through the vribles s* nd D* depends on whether the chnge in the severity of supply disruptions is due to chnge in m or is due to chnge in l. The optiml inventory strtegy to mnge chnge in stockout behvior should be to move the order-up-to level S* in the sme direction s the chnge in expected cost per demnd rriving during stockout g. The djustment in the vlue of S* should be chieved lmost exclusively through the optiml reorder point s*. / 8m27$$ :11:55 nr W: Nv Res 994

13 Arreol-Ris nd DeCroix: Inventory Mngement with Supply Disruptions 699 Due to the lck of previous reserch on the subject of rndom supply disruptions in stochstic-demnd inventory systems with prtil bckorders, the work presented here must be regrded s just one step forwrd in understnding such systems. Some obvious directions for extending this work prllel erlier dvnces in inventory mngement without supply disruptions or prtil bckorders. Such directions include serching for the optiml inventory policy or llowing for nonsttionry costs perhps depending on the stte of the supply. Although we expect tht the bsic flvor of our results will hold for much more generl systems thn the one considered here, significnt dditionl insights my be gined by explicitly ddressing some of these issues. APPENDIX PROOF OF PROPOSITION 1: Let us first derive the expression for b. Modeling the evolution of supply disruptions s two-stte continuous-time Mrkov chin, it is not difficult to demonstrte tht Pr{supply is unvilble t time t} Å l l / m [1 0 e 0(l/m)t ]. Define X s the time when the inventory level hits s nd let f X (r) denote its probbility density function. Then b Å l 0 e l / m [1 0(l/m)x ] f X ( x) dx. 0 Becuse D is Poisson process, X is distributed Erlng with prmeters nd D, where We thus hve b Å l l / m G(D) 0 f X ( x) Å (x)d01 e 0x G(D), x ú 0. [1 0 e 0(l/m)x ](x) D01 e 0x dx Å l l / m 1 0 / l / m D. Let i denote the inventory level, j Å 0 if the supply is vilble nd j Å 1 otherwise, nd P(i, j) be the limiting or stedy-stte probbility of being in stte (i, j). Using stochstic blnce rguments, we constructed the trnsitionrte digrm depicted in Figure 4. Bsic procedures plus tedious lgebric mnipultions led to P(S, 0)Å P(S, 1)Å m( / m) (md / b)( / l / m), (7) ml (md / b)( / l / m), (8) m P(i, 0)Å md / b l S/10i / l / m / l / m m, i Å s / 1,...,S 0 1, (9) l / m ml P(i, 1)Å (md / b)(l / m) 1 0 / l / m S/10i, i Å s / 1,...,S 0 1, (10) P(i, 0)Å 0, i s, (11) / 8m27$$ :11:55 nr W: Nv Res 994

14 / 8m27$$ :11:55 nr W: Nv Res 700 Nvl Reserch Logistics, Vol. 45 ( 1998) Figure 4. Stedy-stte probbility nd trnsition-rte digrm for the inventory system under study.

15 Arreol-Ris nd DeCroix: Inventory Mngement with Supply Disruptions 701 mb P(i, 1)Å md / b s/10i, i Å 1,...,s, (12) / m P(i, 1)Å m q / m b md / b / m s q q / m 0i, i 0. (13) From bsic principles K Å kn/ hoh/ pls/ p 0 BR / p 1 BL. Define cycle s the time intervl between order receipts nd denote its length by T. Let T 1 be the cycle length if the supply is vilble when the inventory level hits s, let T 2 be the cycle length if the supply is unvilble when the inventory level hits s, nd let A be n indictor rndom vrible defined by 1 if the supply is vilble when the inventory level hits s, A Å 0 otherwise. Also define X 1 to be n Erlng rndom vrible with prmeters nd D, nd define X 2 to be n exponentil rndom vrible with prmeter m. Then T Å T 1 / T 2, T 1 Å AX 1, nd T 2 Å (1 0 A 1 )(X 1 / X 2 ). Therefore, E(T 1 ) Å E(E(T 1 ÉA)) Å Pr{A Å 1}E(T 1 ÉA Å 1) / Pr{A Å 0}E(T 1 ÉA Å 0) Å (1 0 b)e(x 1 ) / br0 Å (1 0 b) D nd E(T 2 ) Å E(E(T 2 ÉA)) Å Pr{A Å 1}E(T 2 ÉA Å 1) / Pr{A Å 0}E(T 2 ÉA Å 0) Å (1 0 b)r0 / b(e(x 1 ) / E(X 2 )) Å b D / 1 m. Therefore, E(T ) Å (1 0 b) D / bd / b m Å D / b m Å md / b m. Hence, since N Å 1/E(T ), we hve N Å m md / b. The expressions for OH, LS, BR, nd BL follow from Eqs. (7) (13) nd lgebr. PROOF OF PROPOSITION 2: It is esy to show tht Ì 2 K/Ìs 2 0 for ny D, thus estblishing convexity in s. The reminder of the result follows from lgebric mnipultion of the condition / 8m27$$ :11:55 nr W: Nv Res 994

16 702 Nvl Reserch Logistics, Vol. 45 ( 1998) ÌK ú 0 Ìs så0 (which would imply s* Å 0) nd the condition (which yields the optiml s* if(ìk/ìs)é så0 0). ÌK Ìs Å 0 PROOF OF PROPOSITION 3: We will first show tht the rtio D/b is incresing in D. From Proposition 1 D b Å D l ( l / m)[1 0 ( / l / m) D ]. Let g(d) Å D/[1 0 (/( / l / m)) D ]. Then 1 / ( / l / m) D [D ln( / l / m) 0 1] g (D) Å. [1 0 ( / l / m) D ] 2 If 0 õ õ 1 nd x 0, clerly x 1 / x ln(). Hence D 1 / D / l / m ln, / l / m nd thus 1 / D D / l / m ln 0 / l / m 1 1 / 1 / D ln / l / m D ln 0 / l / m 1 2 ln 2 Å D 0. / l / m Therefore, D/b is incresing in D. The result in Proposition 3 follows from the fct tht K is superdditive on the sublttice {0, 1, rrr} 1 {1, 2, rrr}. (For summry of the necessry lttice progrmming results, see Topkis [24].) Superdditivity of K is equivlent to the condition Ì 2 K ÌsÌD 0. This condition on K holds term by term becuse D/b is incresing in D. PROOF OF PROPOSITION 4: Let e denote the frction of time tht the inventory system is incurring stockouts (lost sles or bckorders). Using bsic principles, it is not hrd to show tht e Å r s (md/b) / 1. Combining the bove eqution with the result tht D/b is incresing in D (demonstrted in the proof of Proposition 3) yields Proposition 4. / 8m27$$ :11:55 nr W: Nv Res 994

17 Arreol-Ris nd DeCroix: Inventory Mngement with Supply Disruptions 703 ACKNOWLEDGMENTS We wnt to thnk the ssocite editor nd the referees for their comments, which led to much improved pper. REFERENCES [ 1] Bielecki, R.E., nd Kumr, P.R., Optimlity of Zero Inventory Policies for Unrelible Mnufcturing Systems, Opertions Reserch, 36, ( 1988). [ 2] Cho, H., Inventory Policy in the Presence of Mrket Disruptions, Opertions Reserch, 2, (1987). [ 3] Cho, H., Chpel, S.W., Clrk, C.E., Morris, P.A., Sndling, M.J., nd Grimes, R.C., EPRI Reduces Fuel Inventory Costs in the Electric Utility Industry, Interfces, 19, (1989). [ 4] Gllego, G., Scheduling the Production of Severl Items with Rndom Demnds in Single Fcility, Mngement Science, 36, (1990). [ 5] Gllego, G., When is Bse Stock Policy Optiml in Recovering Disrupted Cyclic Schedules?, Nvl Reserch Logistics, 41, (1994). [ 6] Groenevelt, H., Seidmnn, A., nd Pintelon, D., Production Lotsizing with Mchine Brekdowns, Mngement Science, 38, ( 1992). [ 7] Groenevelt, H., Pintelon, D., nd Seidmnn, A., Production Btching with Mchine Brekdowns nd Sfety Stocks, Opertions Reserch, 40, ( 1992). [8] Gupt, D., The (Q, r) Inventory System with n Unrelible Supplier, INFOR, 34, (1996). [ 9] Hdley, G., nd Whitin, T.M., Anlysis of Inventory Systems, Prentice-Hll, Englewood Cliffs, NJ, [10] Kim, D.H., nd Prk, K.S., (Q, r) Inventory Model with Mixture of Lost Sles nd Time Weighted Bckorders, Journl of Opertionl Reserch Society, 36, ( 1985). [ 11] Meyer, R.R., Rothkopf, M.H., nd Smith, S.A., Relibility nd Inventory in Production- Storge System, Mngement Science, 25, ( 1979). [ 12] Moinzdeh, K., Operting Chrcteristics of the ( S, S 0 1) Inventory System with Prtil Bckorders nd Constnt Resupply Times, Mngement Science, 35, ( 1989). [ 13] Moinzdeh, K., Replenishment nd Stocking Policies for Inventory Systems with Rndom Del Offerings, Mngement Science, 43, (1997). [ 14] Moinzdeh, K., nd Aggrwl, P.K., Anlysis of Production/ Inventory System Subject to Rndom Disruptions, Mngement Science, 43, (1997). [ 15] Montgomery, D.C., Bzr, M.S., nd Keswni, A.K., Inventory Models with Mixture of Bckorders nd Lost Sles, Nvl Reserch Logistics Qurterly, 20, ( 1973). [ 16] Ozekici, S., nd Prlr, M., Periodic-Review Inventory Models in Rndom Environment, Working Pper, School of Business, McMster University, [ 17] Prlr, M., Continuous-Review Inventory Problem with Rndom Supply Interruptions, Europen Journl of Opertionl Reserch, 99, (1997). [ 18] Prlr, M., nd Berkin, D., Future Supply Uncertinty in EOQ Models, Nvl Reserch Logistics, 38, (1991). [19] Prlr, M., nd Perry, D., Optiml (Q, r, T ) Policies in Deterministic nd Rndom Yield Models with Uncertin Future Supply, Europen Journl of Opertionl Reserch, to pper. [ 20] Prlr, M., nd Perry, D., Inventory Models of Future Supply Uncertinty with Single nd Multiple Suppliers, Nvl Reserch Logistics, 43, (1996). [ 21] Posner, M.J., nd Berg, M., Anlysis of Production-Inventory System with Unrelible Production Fcility, Opertions Reserch Letters, 8, ( 1989). [ 22] Posner, M.J., nd Ynsouni, B., A Clss of Inventory Models with Customer Imptience, Nvl Reserch Logistics Qurterly, 19, ( 1972). [ 23] Song, J., nd Zipkin, P., Inventory Control with Informtion bout Supply Conditions, Mngement Science, 42, ( 1996). [24] Topkis, D., Minimizing Submodulr Function on Lttice, Opertions Reserch, 26, (1978). [ 25] Weiss, H.J., nd Rosenthl, E.C., Optiml Ordering Policies when Anticipting Disruption in Supply or Demnd, Europen Journl of Opertionl Reserch, 59, ( 1992). / 8m27$$ :11:55 nr W: Nv Res 994

Deteriorating Inventory Model for Waiting. Time Partial Backlogging

Deteriorating Inventory Model for Waiting. Time Partial Backlogging Applied Mthemticl Sciences, Vol. 3, 2009, no. 9, 42-428 Deteriorting Inventory Model for Witing Time Prtil Bcklogging Nit H. Shh nd 2 Kunl T. Shukl Deprtment of Mthemtics, Gujrt university, Ahmedbd. 2

More information

Review of Calculus, cont d

Review of Calculus, cont d Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3

UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

More information

New Expansion and Infinite Series

New Expansion and Infinite Series Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

Math 8 Winter 2015 Applications of Integration

Math 8 Winter 2015 Applications of Integration Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007 A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus

More information

7.2 The Definite Integral

7.2 The Definite Integral 7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

More information

13: Diffusion in 2 Energy Groups

13: Diffusion in 2 Energy Groups 3: Diffusion in Energy Groups B. Rouben McMster University Course EP 4D3/6D3 Nucler Rector Anlysis (Rector Physics) 5 Sept.-Dec. 5 September Contents We study the diffusion eqution in two energy groups

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph

More information

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a). The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples

More information

Online Supplements to Performance-Based Contracts for Outpatient Medical Services

Online Supplements to Performance-Based Contracts for Outpatient Medical Services Jing, Png nd Svin: Performnce-bsed Contrcts Article submitted to Mnufcturing & Service Opertions Mngement; mnuscript no. MSOM-11-270.R2 1 Online Supplements to Performnce-Bsed Contrcts for Outptient Medicl

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below. Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we

More information

Student Activity 3: Single Factor ANOVA

Student Activity 3: Single Factor ANOVA MATH 40 Student Activity 3: Single Fctor ANOVA Some Bsic Concepts In designed experiment, two or more tretments, or combintions of tretments, is pplied to experimentl units The number of tretments, whether

More information

EOQ when holding costs grow with the stock level: well-posedness and solutions 1

EOQ when holding costs grow with the stock level: well-posedness and solutions 1 AMO - Advnced Modeling nd Optimiztion, Volume 1, Number 2, 28 EOQ when holding costs grow with the stock level: well-posedness nd solutions 1 Giovnni Mingri Scrpello nd Dniele Ritelli Diprtimento di Mtemtic

More information

Acceptance Sampling by Attributes

Acceptance Sampling by Attributes Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire

More information

The steps of the hypothesis test

The steps of the hypothesis test ttisticl Methods I (EXT 7005) Pge 78 Mosquito species Time of dy A B C Mid morning 0.0088 5.4900 5.5000 Mid Afternoon.3400 0.0300 0.8700 Dusk 0.600 5.400 3.000 The Chi squre test sttistic is the sum of

More information

Reinforcement Learning

Reinforcement Learning Reinforcement Lerning Tom Mitchell, Mchine Lerning, chpter 13 Outline Introduction Comprison with inductive lerning Mrkov Decision Processes: the model Optiml policy: The tsk Q Lerning: Q function Algorithm

More information

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

More information

Week 10: Line Integrals

Week 10: Line Integrals Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.

More information

Stuff You Need to Know From Calculus

Stuff You Need to Know From Calculus Stuff You Need to Know From Clculus For the first time in the semester, the stuff we re doing is finlly going to look like clculus (with vector slnt, of course). This mens tht in order to succeed, you

More information

Ordinary differential equations

Ordinary differential equations Ordinry differentil equtions Introduction to Synthetic Biology E Nvrro A Montgud P Fernndez de Cordob JF Urchueguí Overview Introduction-Modelling Bsic concepts to understnd n ODE. Description nd properties

More information

Continuous Random Variables

Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht

More information

APPROXIMATE INTEGRATION

APPROXIMATE INTEGRATION APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be

More information

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy

More information

Chapter 5 : Continuous Random Variables

Chapter 5 : Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll

More information

Lecture 14: Quadrature

Lecture 14: Quadrature Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl

More information

Credibility Hypothesis Testing of Fuzzy Triangular Distributions

Credibility Hypothesis Testing of Fuzzy Triangular Distributions 666663 Journl of Uncertin Systems Vol.9, No., pp.6-74, 5 Online t: www.jus.org.uk Credibility Hypothesis Testing of Fuzzy Tringulr Distributions S. Smpth, B. Rmy Received April 3; Revised 4 April 4 Abstrct

More information

and that at t = 0 the object is at position 5. Find the position of the object at t = 2.

and that at t = 0 the object is at position 5. Find the position of the object at t = 2. 7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we

More information

5.7 Improper Integrals

5.7 Improper Integrals 458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the

More information

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1 Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution

More information

MAA 4212 Improper Integrals

MAA 4212 Improper Integrals Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which

More information

Appendix 3, Rises and runs, slopes and sums: tools from calculus

Appendix 3, Rises and runs, slopes and sums: tools from calculus Appendi 3, Rises nd runs, slopes nd sums: tools from clculus Sometimes we will wnt to eplore how quntity chnges s condition is vried. Clculus ws invented to do just this. We certinly do not need the full

More information

Math 360: A primitive integral and elementary functions

Math 360: A primitive integral and elementary functions Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:

More information

Generalized Fano and non-fano networks

Generalized Fano and non-fano networks Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz

More information

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses

More information

Using QM for Windows. Using QM for Windows. Using QM for Windows LEARNING OBJECTIVES. Solving Flair Furniture s LP Problem

Using QM for Windows. Using QM for Windows. Using QM for Windows LEARNING OBJECTIVES. Solving Flair Furniture s LP Problem LEARNING OBJECTIVES Vlu%on nd pricing (November 5, 2013) Lecture 11 Liner Progrmming (prt 2) 10/8/16, 2:46 AM Olivier J. de Jong, LL.M., MM., MBA, CFD, CFFA, AA www.olivierdejong.com Solving Flir Furniture

More information

Tests for the Ratio of Two Poisson Rates

Tests for the Ratio of Two Poisson Rates Chpter 437 Tests for the Rtio of Two Poisson Rtes Introduction The Poisson probbility lw gives the probbility distribution of the number of events occurring in specified intervl of time or spce. The Poisson

More information

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0) 1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this

More information

Riemann is the Mann! (But Lebesgue may besgue to differ.)

Riemann is the Mann! (But Lebesgue may besgue to differ.) Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >

More information

Module 6: LINEAR TRANSFORMATIONS

Module 6: LINEAR TRANSFORMATIONS Module 6: LINEAR TRANSFORMATIONS. Trnsformtions nd mtrices Trnsformtions re generliztions of functions. A vector x in some set S n is mpped into m nother vector y T( x). A trnsformtion is liner if, for

More information

Infinite Geometric Series

Infinite Geometric Series Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

More information

Numerical integration

Numerical integration 2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter

More information

Frobenius numbers of generalized Fibonacci semigroups

Frobenius numbers of generalized Fibonacci semigroups Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

MATH 144: Business Calculus Final Review

MATH 144: Business Calculus Final Review MATH 144: Business Clculus Finl Review 1 Skills 1. Clculte severl limits. 2. Find verticl nd horizontl symptotes for given rtionl function. 3. Clculte derivtive by definition. 4. Clculte severl derivtives

More information

Vyacheslav Telnin. Search for New Numbers.

Vyacheslav Telnin. Search for New Numbers. Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "Non-Stndrd Anlysis" by V. Uspensky, in which

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response

More information

Reinforcement learning II

Reinforcement learning II CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic

More information

approaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below

approaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below . Eponentil nd rithmic functions.1 Eponentil Functions A function of the form f() =, > 0, 1 is clled n eponentil function. Its domin is the set of ll rel f ( 1) numbers. For n eponentil function f we hve.

More information

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by. NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with

More information

Arithmetic & Algebra. NCTM National Conference, 2017

Arithmetic & Algebra. NCTM National Conference, 2017 NCTM Ntionl Conference, 2017 Arithmetic & Algebr Hether Dlls, UCLA Mthemtics & The Curtis Center Roger Howe, Yle Mthemtics & Texs A & M School of Eduction Relted Common Core Stndrds First instnce of vrible

More information

different methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s).

different methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s). Mth 1A with Professor Stnkov Worksheet, Discussion #41; Wednesdy, 12/6/217 GSI nme: Roy Zho Problems 1. Write the integrl 3 dx s limit of Riemnn sums. Write it using 2 intervls using the 1 x different

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Cf. Linn Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems, Wiley Series in Probability & Statistics, 1999.

Cf. Linn Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems, Wiley Series in Probability & Statistics, 1999. Cf. Linn Sennott, Stochstic Dynmic Progrmming nd the Control of Queueing Systems, Wiley Series in Probbility & Sttistics, 1999. D.L.Bricker, 2001 Dept of Industril Engineering The University of Iow MDP

More information

Overview of Calculus I

Overview of Calculus I Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,

More information

Published online: 18 Jun 2013.

Published online: 18 Jun 2013. This rticle ws downloded by: [Dokuz Eylul University ] On: 3 My 014, At: :48 Publisher: Tylor & Frncis Inform Ltd Registered in Englnd nd Wles Registered Number: 107954 Registered office: Mortimer House,

More information

Review of basic calculus

Review of basic calculus Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below

More information

2D1431 Machine Learning Lab 3: Reinforcement Learning

2D1431 Machine Learning Lab 3: Reinforcement Learning 2D1431 Mchine Lerning Lb 3: Reinforcement Lerning Frnk Hoffmnn modified by Örjn Ekeberg December 7, 2004 1 Introduction In this lb you will lern bout dynmic progrmming nd reinforcement lerning. It is ssumed

More information

Math 270A: Numerical Linear Algebra

Math 270A: Numerical Linear Algebra Mth 70A: Numericl Liner Algebr Instructor: Michel Holst Fll Qurter 014 Homework Assignment #3 Due Give to TA t lest few dys before finl if you wnt feedbck. Exercise 3.1. (The Bsic Liner Method for Liner

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

Chapters 4 & 5 Integrals & Applications

Chapters 4 & 5 Integrals & Applications Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions

More information

CBE 291b - Computation And Optimization For Engineers

CBE 291b - Computation And Optimization For Engineers The University of Western Ontrio Fculty of Engineering Science Deprtment of Chemicl nd Biochemicl Engineering CBE 9b - Computtion And Optimiztion For Engineers Mtlb Project Introduction Prof. A. Jutn Jn

More information

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b

More information

Reliable Optimal Production Control with Cobb-Douglas Model

Reliable Optimal Production Control with Cobb-Douglas Model Relible Computing 4: 63 69, 998. 63 c 998 Kluwer Acdemic Publishers. Printed in the Netherlnds. Relible Optiml Production Control with Cobb-Dougls Model ZHIHUI HUEY HU Texs A&M University, College Sttion,

More information

Math 426: Probability Final Exam Practice

Math 426: Probability Final Exam Practice Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by

More information

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (

More information

arxiv:math/ v2 [math.ho] 16 Dec 2003

arxiv:math/ v2 [math.ho] 16 Dec 2003 rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,

More information

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar) Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of

More information

UNIT 1 FUNCTIONS AND THEIR INVERSES Lesson 1.4: Logarithmic Functions as Inverses Instruction

UNIT 1 FUNCTIONS AND THEIR INVERSES Lesson 1.4: Logarithmic Functions as Inverses Instruction Lesson : Logrithmic Functions s Inverses Prerequisite Skills This lesson requires the use of the following skills: determining the dependent nd independent vribles in n exponentil function bsed on dt from

More information

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance Generl structure ECO 37 Economics of Uncertinty Fll Term 007 Notes for lectures 4. Stochstic Dominnce Here we suppose tht the consequences re welth mounts denoted by W, which cn tke on ny vlue between

More information

A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int

A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE HANS RINGSTRÖM. Questions nd exmples In the study of Fourier series, severl questions rise nturlly, such s: () (2) re there conditions on c n, n Z, which ensure

More information

Convergence of Fourier Series and Fejer s Theorem. Lee Ricketson

Convergence of Fourier Series and Fejer s Theorem. Lee Ricketson Convergence of Fourier Series nd Fejer s Theorem Lee Ricketson My, 006 Abstrct This pper will ddress the Fourier Series of functions with rbitrry period. We will derive forms of the Dirichlet nd Fejer

More information

ODE: Existence and Uniqueness of a Solution

ODE: Existence and Uniqueness of a Solution Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =

More information

PRODUCTION INVENTORY MODEL WITH DISRUPTION CONSIDERING SHORTAGE AND TIME PROPORTIONAL DEMAND

PRODUCTION INVENTORY MODEL WITH DISRUPTION CONSIDERING SHORTAGE AND TIME PROPORTIONAL DEMAND Yugoslv Journl of Opertions Reserch 28 (2018), Number 1, 123 139 DOI: https://doi.org/10.2298/yjor161118008k PRODUCTION INVENTORY MODEL WITH DISRUPTION CONSIDERING SHORTAGE AND TIME PROPORTIONAL DEMAND

More information

fractions Let s Learn to

fractions Let s Learn to 5 simple lgebric frctions corne lens pupil retin Norml vision light focused on the retin concve lens Shortsightedness (myopi) light focused in front of the retin Corrected myopi light focused on the retin

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

N 0 completions on partial matrices

N 0 completions on partial matrices N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver

More information

MATH SS124 Sec 39 Concepts summary with examples

MATH SS124 Sec 39 Concepts summary with examples This note is mde for students in MTH124 Section 39 to review most(not ll) topics I think we covered in this semester, nd there s exmples fter these concepts, go over this note nd try to solve those exmples

More information

1 Probability Density Functions

1 Probability Density Functions Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

CS667 Lecture 6: Monte Carlo Integration 02/10/05

CS667 Lecture 6: Monte Carlo Integration 02/10/05 CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of

More information

Numerical Integration

Numerical Integration Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the

More information

3.4 Numerical integration

3.4 Numerical integration 3.4. Numericl integrtion 63 3.4 Numericl integrtion In mny economic pplictions it is necessry to compute the definite integrl of relvlued function f with respect to "weight" function w over n intervl [,

More information

SESSION 2 Exponential and Logarithmic Functions. Math 30-1 R 3. (Revisit, Review and Revive)

SESSION 2 Exponential and Logarithmic Functions. Math 30-1 R 3. (Revisit, Review and Revive) Mth 0-1 R (Revisit, Review nd Revive) SESSION Eponentil nd Logrithmic Functions 1 Eponentil nd Logrithmic Functions Key Concepts The Eponent Lws m n 1 n n m m n m n m mn m m m m mn m m m b n b b b Simplify

More information

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 7

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 7 CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees

More information

Heat flux and total heat

Heat flux and total heat Het flux nd totl het John McCun Mrch 14, 2017 1 Introduction Yesterdy (if I remember correctly) Ms. Prsd sked me question bout the condition of insulted boundry for the 1D het eqution, nd (bsed on glnce

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct

More information

Section 14.3 Arc Length and Curvature

Section 14.3 Arc Length and Curvature Section 4.3 Arc Length nd Curvture Clculus on Curves in Spce In this section, we ly the foundtions for describing the movement of n object in spce.. Vector Function Bsics In Clc, formul for rc length in

More information

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More

More information