The (Q, r) Inventory Policy in Production- Inventory Systems

Size: px
Start display at page:

Download "The (Q, r) Inventory Policy in Production- Inventory Systems"

Transcription

1 Proceedngs of SKISE Fall Conference, Nov 14-15, 2008 The ( Inventory Polcy n Producton- Inventory Systems Joon-Seok Km Sejong Unversty Seoul, Korea Abstract We examne the effectveness of the conventonal ( model n managng producton-nventory systems wth fnte capacty, stochastc demand, and stochastc order processng tmes. We show that, for systems wth fnte producton capacty, order replenshment lead tmes are hghly senstve to loadng and order quantty. Consequently, the choce of optmal order quantty and optmal reorder pont can vary sgnfcantly from those obtaned under the usual assumpton of a load-ndependent lead tme. More mportantly, we show that for a gven ( polcy the conventonal model can grossly under or over-estmate the actual cost of the polcy. In cases where a setup tme s assocated wth placng a producton order, we show that the optmal ( polcy derved from the conventonal model can, n fact, be nfeasble. Key-words : ( Inventory Polcy, Producton-Inventory Systems, Make-To-Stock ueue 1. Introducton One of the most common methods for managng nventory systems wth stochastc demand s the reorder pont/order quantty polcy, also known as the ( polcy. Under a ( polcy, fnshed goods nventory s contnuously revewed and a new producton order s placed each tme nventory poston (on-hand nventory + outstandng orders backorders) falls to a reorder pont r. Values for and r are, typcally, selected so that nventory costs (orderng costs + holdng costs + backorderng costs) are mnmzed. Polces of the ( type have been wdely studed, wth a rch body of lterature on ( models datng back to the late 50 s (see, for example, Gallher et al. [7] and Hadley and Whttn [8]). For sngle tem nventory systems under the standard assumptons, an optmal polcy can, n fact, be shown to exst wthn the class of ( polces [5]. The applcablty of ( polces has been extended to nventory systems wth multple tems and multple echelons (see for example Atkns and Iyogun [1] and Chen and Zheng [6] and the references theren). In determnng optmal values for and r, t s assumed n most of the exstng lterature that order replenshment lead tmes are not senstve to the loadng of the producton faclty or to the order quantty. In fact, the most common assumpton s a fxed postve lead tme [10]. Ths assumpton s realstc when the nventory system s fully decoupled from the producton system through large nventory holdng at the producton faclty or at subsequent stages of the supply chan (for example, when a local retaler s replenshed from a large regonal warehouse). It may also be realstc when non-producton lead tme s long (for example, when transportaton lead tmes are sgnfcantly longer than manufacturng lead tmes). However, for most ntegrated producton-nventory systems, these assumptons rarely hold. In fact, wth ncreased emphass on lean manufacturng, fnshed goods nventory at factores has become much more tghtly controlled and materal handlng tme between the producton faclty and the fnshedgoods warehouse s often mnmal. Smlar prncples are beng appled to the entre supply chan wth much tghter couplng between retalers, dstrbutors and supplers takng place. Ths 183

2 The ( Inventory Polcy Producton-Inventory Systems Joon-Seok Km ncreased couplng means that dstrbutors and retalers are often mmedately affected by congeston and delays on the factory floor [4]. In ths paper, we examne the mpact of explctly modelng producton lead tmes on nventory costs, order replenshment lead tmes, and the optmal ( polcy. We contrast results obtaned usng our model wth those obtaned usng the conventonal or standard ( model. We show that, for systems wth fnte producton capacty, order replenshment lead tmes are hghly senstve to loadng and order quantty. Consequently, the choce of optmal order quantty and optmal reorder pont can vary sgnfcantly from those obtaned under the usual assumpton of a load-ndependent lead tme. More mportantly, we show that for a gven ( polcy the conventonal model can grossly under or overestmate the actual cost of the polcy dependng on the value of lead tme used n the standard model. Equally sgnfcant, we show that the order quantty that mnmzes order replenshment lead tme s not necessarly the one that mnmzes total cost. In cases where a setup tme as well as a setup cost, s assocated wth placng a producton order, the optmal ( polcy derved from the standard model can be, n fact, nfeasble. To llustrate our results we restrct our dscusson ntally to the case where demand s Posson dstrbuted snce ths s one of the few cases for whch the optmal soluton to the standard model can be easly obtaned. 2. The Producton-Inventory ( Model In contrast to the standard ( model, we consder an ntegrated producton-nventory system, where nventory s replenshed from a producton faclty wth fnte capacty. Inventory s managed accordng to a ( polcy smlar to the standard polcy. That s, a producton order of sze s placed each tme nventory poston drops to the reorder pont r. As n the standard model, the order s delvered once all unts have been produced (t s possble to extend the model to allow for unt by unt replenshment). As n the standard model, we assume that demand occurs one unt at a tme accordng to a Posson process wth rate λ. Although customer orders arrve ndvdually, a producton order s placed only after customer orders are receved. Therefore, the nter-arrval tme of orders to the producton system s Erlang wth phase. In contrast to the standard model, we let producton capacty be fnte wth a postve processng rate μ. We consder the case where unt processng tmes are ndependent, dentcal and exponentally dstrbuted random varables wth mean 1/ μ. Snce the processng tme of an order of sze s the sum of ndependent, dentcal and exponentally dstrbuted random varables, order processng tme s Erlang wth phase. Thus, the producton faclty can be vewed as an E /E /1 queueng system (.e. a sngle-server queueng system wth Erlang nter-arrval and processng tmes). If we let refer to nventory level, n to the number of producton orders n the producton system (each order s of sze ), z to the number of customer unt demands that have yet to be ordered (an order s placed only when nventory poston reaches the reorder pont), and j to the number of backorders, then t s easy to see that = { + r n z} + and j = {n + z r} +. The number of nventory and the number of backorders are dependent upon r, n and z. For example, f we have =3, r=10, n=1, and z=2, the nventory level s 8 (3+10-1(3)-2=8) and the number of backorders s 0. Notng that z s unformly dstrbuted on {0, 1,, 1} (ths follows from the fact that nventory poston s unformly dstrbuted on {r + 1, r + 2,, r + }[5]), t s straghtforward to show that: 1 + r PI ( ) ( ), = 1, 2,..., +r (1) and 1 + r + j PB ( j) ( ), j = 1, 2,..., (2) where P I (-),P B (-), and P N (-) refer, respectvely, to the steady state probablty dstrbuton of 184

3 Proceedngs of SKISE Fall Conference, Nov 14-15, 2008 nventory level, number of backorders, and number of orders n the producton faclty (n queue + n servce). For the steady state probabltes to exst, we requre the stablty condton ρ= λ/μ< 1, where ρrefers to the utlzaton of the producton faclty. From 1 and 2, we can obtan average nventory, average number of backorders and average order replenshment lead tme as follows: I = = 1 + r = 1 P I ( ), (3) B = P B( ), and (4) =1 L = P ( N ) / λ. (5) A closed form expresson for the probablty dstrbuton of the number of customers n an E /E /1 system s dffcult to obtan. However, the probabltes can be computed numercally (see for example Neuts [9] for a matrx-geometrc approach). Notng that P N () converges to zero as approaches nfnty, I, B and L can be computed to desred accuracy. Our cost functon can now be wrtten as: C p ( λ + r + r = K + h P ( ) = 1 N + r + + b P ( ) = 1 N We can show that C P ( s convex n r (see Appendx 1). Therefore, for each order sze the optmal reorder pont can be easly obtaned usng standard convex optmzaton. The optmal order quantty can be obtaned by an exhaustve search over the range of feasble order szes (although numercal results suggest that C P ( s jontly convex n and r, showng jont convexty analytcally s dffcult). 3. Comparsons wth the standard ( model In ths paper, the standard ( model refers to a sngle tem contnuous revew nventory model where demand s statonary and occurs one unt at a tme wth rate λ. An order of fxed quantty s placed whenever nventory poston drops to a fxed (6) reorder pont r. Orders are delvered after a fxed postve lead tme L. The other settngs reman same as the producton-nventory ( model. The long run average cost C S ( under the above condtons s gven by the followng (see, for example, Federgruen and Zheng [5]): C s λ ( = K + h ( y ) + b = y r y = 1 = 0 ( y) p p (7) where p s the probablty that total demand durng lead tme s. The above expresson s exact when the nventory poston n steady state s unformly dstrbuted on {r+1, r+2,..., r+} and s n-dependent of demand durng lead tme. Ths condton s satsfed when demand s Posson, n whch case p s gven by p = e λl ( λl) /!. Although closed form expressons for the optmal order quantty and optmal reorder pont ( *, r * ) are dffcult to obtan, an effcent algorthm for calculatng * and r * has been proposed by Federgruen and Zheng [5]. Snce the order quantty affects both the dstrbuton of the arrval process to and the processng tme at the producton faclty, t s easy to show that lead tme s senstve to our choce of order quantty (see expresson 5). Also, snce congeston at the producton faclty s affected by both the avalable capacty and demand level, lead tme s affected by the utlzaton of the producton faclty. The behavor of average lead tme, for varyng order quanttes and utlzaton levels, s llustrated n Fgure 1. As we can see, lead tme s ncreasng n both and ρ. Whle the fxed lead tme ncreases n the standard model, the producton-nventory system experences more congeston n ts producton faclty. Therefore, for each fxed lead tme n the standard model, dfferent utlzaton should be used to generate the same average lead tme n the producton-nventory model. Because lead tme s affected by the choce of whch, n turn, affects 185

4 The ( Inventory Polcy Producton-Inventory Systems Joon-Seok Km our choce of r, the optmal values of and r obtaned respectvely by the standard and the producton-nventory models are generally dfferent. Fgure 2. The effect of lead tme on optmal order quantty (λ = 2, h = 1.0, b = 1.0, K = 10.0) Fgure 1. The effect of order quantty on average lead tme (λ = 2, µ = 4.0, 3.33, 2.857, 2.5, h = 1.0, b = 1.0, K = 10.0) Dependng on the value of lead tme used n the standard model, the dfference n these values can be sgnfcant. Ths s llustrated n Fgures 2 and 3, where values of * and r * for both models are shown for varyng assumptons of fxed lead tme (we use the notaton ( * s, r * s ) and ( * p, r * p ) to dfferentate, respectvely, between the optmal soluton to the standard ( model and the producton-nventory model). It s nterestng to note that generally bgger * s and smaller r * s were chosen n the producton-nventory model when lead tme ncreases. More mportantly, the value of fxed lead tme for whch the two optmal order quanttes are the same does not generally correspond to the actual lead tme experenced by the producton-nventory system. The fact that * and r *, as well as lead tme, are dfferent under the two models, means that average nventory and average number of backorders are also dfferent. In turn, ths means that the estmated costs of the optmal polces under the two models can also be very dfferent. In fact, dependng on the value of lead tme used n the standard model, ths dfference can be qute sgnfcant. Ths s llustrated n Fgure 4. Note that the fxed lead tme does not usually correspond to the actual lead tme n the producton-nventory system. Fgure 3. The effect of lead tme on optmal reorder pont (λ = 2, h = 1.0, b = 1.0, K = 10.0) Fgure 4. The effect of lead tme on optmal cost (λ = 2, h = 1.0, b = 1.0, K = 10.0) More mportantly, the standard ( model can sgnfcantly under-estmate the true costs of mplementng the correspondng optmal polcy (or n fact, any ( polcy). In Fgure 5, we show the dfference between the optmal costs, as estmated by the standard model, and the true costs of 186

5 Proceedngs of SKISE Fall Conference, Nov 14-15, 2008 mplementng ths polcy as obtaned from the producton nventory model. That s the ( *, r * ) chosen n the standard model were drectly nserted nto the cost functon of the producton-nventory model n order to get the exact cost when the system experences the congeston. Agan, we can see that ths dfference s dependent on the choce of lead tme (n the standard model) and can be qute large. Fgure 5. The Impact of lead tme on estmated and actual costs (λ = 2, µ = 2.5, h = 1.0, b = 1.0, K = 10.0) In addton to nducng errors n estmatng nventory holdng costs, backorderng costs, and orderng costs, the standard model can lead to errors n estmatng other performance metrcs, such as customer order fulfllment tme, fll rate, or the probablty of stock-out. For example, customer order fulfllment tme (the duraton from the tme when a customer places an order to the tme when the order s shpped) s gven, respectvely for the standard and producton-nventory models, by the followng: F s B + r = = λ = 1 = y + 1 ( y) p λ (8) B m + r + m F = = P (9) p λ N m = 1 Snce average order fulfllment tme s lnearly ncreasng n the average number of backorders, order fulfllment s smlarly senstve to the choce of order quantty. 4. The Impact of Setup Tmes In many producton systems, a setup tme s requred pror to the ntaton of an order. A nonzero setup tme ncreases order-processng tme and, therefore, ncreases order lead tme. Snce both average nventory and number of backorders are senstve to lead tme, the ntroducton of setup tme affects total cost. In turn, ths affects the value of the optmal order quantty and the optmal reorder pont. More mportantly, a non-zero setup tme affects the stablty condton of the producton system and places a mnmum requrement on order sze. Ths can be seen by notng that wth non-zero setup tmes the stablty condton s gven by the followng: λs/+λ/µ < 1, (10) whch can be rewrtten as: > λs/(1 λ/µ), (11) where S s average setup tme. The rght-hand sde of (11) represents, for a gven average setup tme, the mnmum feasble order sze (.e., a smaller order sze would result n nfntely long lead tmes). We should note that, although a setup cost s ncluded n the standard ( model, the model does not account for setup tme nor does t account for the relatonshp between order sze and frequency of setups, and ther jont effect on producton capacty. Therefore, the standard model could lead to the choce of an nfeasble order quantty. In order to examne the effect of setup tme on lead tme, optmal order quantty, and optmal reorder pont, we consdered the case where setup tmes are exponentally dstrbuted. In ths case, order processng tme can be represented by a generalzed Erlang dstrbuton wth + 1 phases where phase 1 represents setup tme. A smlar approach to the one descrbed n secton 4 can be used to compute average nventory level, average number of backorders, and average lead tme. These can then be used to determne optmal order quantty and reorder pont. 187

6 The ( Inventory Polcy Producton-Inventory Systems Joon-Seok Km Fgure 6. The effect of order quantty on average lead tme (λ = 2, µ = 2.5, h = 1.0, b = 1.0, K = 10.0) further ncreases n result n suffcent ncreases n the order processng tme leadng to an overall ncrease n lead tme. Smlar observatons were made by Karmarkar [8] and Benjaafar and Shekhzadeh [2] for make to order systems. In Fgures 7 and 8, we llustrate the mpact of setup tme on the value of the optmal order quantty and reorder pont. As we can see, both quanttes are hghly senstve to setup tme. The effect of setup tme s partcularly pronounced when utlzaton s hgh. We should note that snce these effects are gnored by the standard model, the values of * and r * obtaned from the standard model could be agan very dfferent from those we obtan usng the producton-nventory model. Fgure 7. The effect of setup tme on optmal order quantty (λ = 2, µ = 3.333, , 2.5, h = 1.0, b = 1.0, K = 10.0) Fgure 8. The effect of setup tme on optmal reorder pont (λ = 2, µ = 3.333, , 2.5, h = 1.0, b = 1.0, K = 10.0) In Fgure 6, we show numercal results that llustrate the effect of order quantty on lead tme for varyng values of setup tme. It s nterestng to note that, n contrast to the case wth zero setup tme, the effect of order quantty on lead tme s not monotonc. Intal ncreases n reduce lead tme by reducng the frequency of setups. However, 5. Concluson In ths paper, we proposed the productonnventory ( models wth fnte capacty, stochastc demand, and stochastc processng tmes and we demonstrated the mportance of modelng the dependency of lead tme on system loadng n producton-nventory systems. Specfcally, we showed that the optmal order quantty and optmal reorder pont could vary sgnfcantly from those obtaned under the usual assumpton of a fxed lead tme. We also showed that the costs estmated usng a fxed lead tme (even f ths fxed lead tme s a good approxmaton of the actual lead tme) could be sgnfcantly dfferent from those actually experenced by the producton-nventory system. For systems where the ntaton of a producton order s preceded by a setup, we found that system stablty s dependent on order sze. Therefore, gnorng ths dependency could lead to system nstablty. These results hghlght the fact that producton and nventory systems cannot be managed (or modeled) separately. It s crtcal when the companes adopt the strateges such as lean manufacturng, where managers should control tghtly both the factory floor and warehouses. Unfortunately, for ( nventory models, the nteracton between producton and nventory has gone largely under-studed. Therefore, there s a 188

7 Proceedngs of SKISE Fall Conference, Nov 14-15, 2008 great opportunty for extendng the exstng lterature on nventory to nclude ths mportant nteracton. Although we have focused on the ( polcy n ths paper, t s worthwhle to carry out smlar analyss wth respect to other common polces such as perodc revew polces. It s also worthwhle to extend the analyss to systems wth multple echelons. In that case, capturng the nteracton between nventory and producton one hand, and nventory and transportaton on the other, becomes mportant. Appendx 1 Lemma 1: Average nventory cost C P ( s convex n r. Proof: In order to show that C P ( s convex n r, t s suffcent to show that average nventory and average number of backorders are convex n r. Let I( refer to average nventory for gven and r. In order to show that average nventory s convex n r, we need to show that [ I( r + 1) + I( r 1) ] 2 I (. Notng that 1 1 I( = {( + PN (0) + ( + r 1) PN ( ) + K, + r 2 + r 1 + 2PN ( ) + PN ( t s not too dffcult to show that I( r + 1) + I( r 1) 1 + r I( ( ) Hence, average nventory s convex n r. Smlarly, we can show that B( r + 1) + B( r 1) 1 + r B( ( ) where B ( r ) s the average number of backorders. Thus, B ( r ) s also convex n r, whch completes our proof. References [1] Atkns, D. and P. Iyogun, Perodc versus Can- Order Polces for Coordnated Mult-tem Inventory Systems, Management Scence, 34 (1988), [2] Benjaafar, S. and M. Shekhzadeh, "Schedulng Polces, Batch Szes, and Manufacturng Lead Tmes," IIE Transactons, 29(1997), [3] Buzacott, J. and G. Shanthkumar, Stochastc Models of Manufacturng Systems, Prentce Hall, Englewood Clffs, NJ, [4] Benjaafar, S., W.L. Cooper and J.S. Km, Benefts of Poolng n Producton-Inventory Systems, Management Scence, 51(2005), [5] Federgruen, A. and Y. S. Zheng, An Effcent Algorthm for Computng an Optmal (r, ) Polcy n Contnuous Revew Stochastc Inventory Systems, Operatons Research, 40 (1992), [6] Chen, F. and Y. S. Zheng, Evaluatng Echelon Stock (R, n) Polces n Seral Producton /Inventory Systems wth Stochastc Demand, Management Scence, 40(1994), [7] Gallher, H. P., P. M. Morse and M. Somond, Dynamcs of Two Classes of Contnuous Revew Inventory Systems, Operatons Research, 7(1957), [8] Hadley, G. and T. Whtn, Analyss of Inventory Systems, Prentce-Hall, Englewood Clffs, NJ [9] Neuts, M. F., Matrx-Geometrc Solutons n Stochastc Models: An Algorthmc Approach, The Johns Hopkns Unversty Press, [10] Slver, E. A., D. F. Pyke, and R. Peterson, Inventory Management and Producton Plannng and Schedulng, John Wley, New York, NY, [11] Karmarkar, U. S., Lot Szes, Leadtmes, and In-Process Inventores, Management Scence, 33(1987),

A Simple Inventory System

A Simple Inventory System A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017

More information

Analysis of Discrete Time Queues (Section 4.6)

Analysis of Discrete Time Queues (Section 4.6) Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary

More information

Inventory Model with Backorder Price Discount

Inventory Model with Backorder Price Discount Vol. No. 7-7 ead Tme and Orderng Cost Reductons are Interdependent n Inventory Model wth Bacorder Prce scount Yu-Jen n Receved: Mar. 7 Frst Revson: May. 7 7 ccepted: May. 7 bstract The stochastc nventory

More information

(1, T) policy for a Two-echelon Inventory System with Perishableon-the-Shelf

(1, T) policy for a Two-echelon Inventory System with Perishableon-the-Shelf Journal of Optmzaton n Industral Engneerng 6 (24) 3-4 (, ) polcy for a wo-echelon Inventory ystem wth Pershableon-the-helf Items Anwar Mahmood a,, Alreza Ha b a PhD Canddate, Industral Engneerng, Department

More information

Queueing Networks II Network Performance

Queueing Networks II Network Performance Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Cardamom Planters Association College, Bodinayakanur, Tamil Nadu, India

Cardamom Planters Association College, Bodinayakanur, Tamil Nadu, India Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07) Research Inda Publcatons http://www.rpublcaton.com OPPTIMIZATION OF TWO-ECHELON INVENTORY SYSTEM WITH TWO SUPPLIERS

More information

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,

More information

The Value of Demand Postponement under Demand Uncertainty

The Value of Demand Postponement under Demand Uncertainty Recent Researches n Appled Mathematcs, Smulaton and Modellng The Value of emand Postponement under emand Uncertanty Rawee Suwandechocha Abstract Resource or capacty nvestment has a hgh mpact on the frm

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

Quantifying sustainable control of inventory systems with non-linear backorder costs

Quantifying sustainable control of inventory systems with non-linear backorder costs Ann Oper Res (217) 259:217 239 DOI 1.17/s1479-17-2542-z ORIGINAL PAPER Quantfyng sustanable control of nventory systems wth non-lnear backorder costs Lna Johansson 1 Fredrk Olsson 1 Publshed onlne: 3 May

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

LATERAL TRANSSHIPMENTS IN INVENTORY MODELS

LATERAL TRANSSHIPMENTS IN INVENTORY MODELS LATERAL TRANSSHIPMENTS IN INVENTORY MODELS MIN CHEN 11.2008 BMI THESIS Lateral Transshpments n Inventory Models MIN CHEN 11.2008 II PREFACE The BMI Thess s the fnal report to acqure the Master's degree

More information

Journal of Physics: Conference Series. Related content PAPER OPEN ACCESS

Journal of Physics: Conference Series. Related content PAPER OPEN ACCESS Journal of Physcs: Conference Seres PAPER OPEN ACCESS An ntegrated producton-nventory model for the snglevendor two-buyer problem wth partal backorder, stochastc demand, and servce level constrants To

More information

STOCHASTIC INVENTORY MODELS INVOLVING VARIABLE LEAD TIME WITH A SERVICE LEVEL CONSTRAINT * Liang-Yuh OUYANG, Bor-Ren CHUANG 1.

STOCHASTIC INVENTORY MODELS INVOLVING VARIABLE LEAD TIME WITH A SERVICE LEVEL CONSTRAINT * Liang-Yuh OUYANG, Bor-Ren CHUANG 1. Yugoslav Journal of Operatons Research 10 (000), Number 1, 81-98 STOCHASTIC INVENTORY MODELS INVOLVING VARIABLE LEAD TIME WITH A SERVICE LEVEL CONSTRAINT Lang-Yuh OUYANG, Bor-Ren CHUANG Department of Management

More information

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of

More information

Order Full Rate, Leadtime Variability, and Advance Demand Information in an Assemble- To-Order System

Order Full Rate, Leadtime Variability, and Advance Demand Information in an Assemble- To-Order System Order Full Rate, Leadtme Varablty, and Advance Demand Informaton n an Assemble- To-Order System by Lu, Song, and Yao (2002) Presented by Png Xu Ths summary presentaton s based on: Lu, Yngdong, and Jng-Sheng

More information

EFFECTS OF JOINT REPLENISHMENT POLICY ON COMPANY COST UNDER PERMISSIBLE DELAY IN PAYMENTS

EFFECTS OF JOINT REPLENISHMENT POLICY ON COMPANY COST UNDER PERMISSIBLE DELAY IN PAYMENTS Mathematcal and Computatonal Applcatons, Vol. 5, No., pp. 8-58,. Assocaton for Scentfc Research EFFECS OF JOIN REPLENISHMEN POLICY ON COMPANY COS UNDER PERMISSIBLE DELAY IN PAYMENS Yu-Chung sao, Mng-Yu

More information

FINAL REPORT. To: The Tennessee Department of Transportation Research Development and Technology Program

FINAL REPORT. To: The Tennessee Department of Transportation Research Development and Technology Program FINAL REPORT To: The Tennessee Department of Transportaton Research Development and Technology Program Project #: Truck Congeston Mtgaton through Freght Consoldaton n Volatle Mult-tem Supply Chans Prepared

More information

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

2016 Wiley. Study Session 2: Ethical and Professional Standards Application

2016 Wiley. Study Session 2: Ethical and Professional Standards Application 6 Wley Study Sesson : Ethcal and Professonal Standards Applcaton LESSON : CORRECTION ANALYSIS Readng 9: Correlaton and Regresson LOS 9a: Calculate and nterpret a sample covarance and a sample correlaton

More information

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data

More information

Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal

Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal Markov chans M. Veeraraghavan; March 17, 2004 [Tp: Study the MC, QT, and Lttle s law lectures together: CTMC (MC lecture), M/M/1 queue (QT lecture), Lttle s law lecture (when dervng the mean response tme

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Suggested solutions for the exam in SF2863 Systems Engineering. June 12,

Suggested solutions for the exam in SF2863 Systems Engineering. June 12, Suggested solutons for the exam n SF2863 Systems Engneerng. June 12, 2012 14.00 19.00 Examner: Per Enqvst, phone: 790 62 98 1. We can thnk of the farm as a Jackson network. The strawberry feld s modelled

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Appendix B: Resampling Algorithms

Appendix B: Resampling Algorithms 407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles

More information

A queuing theory approach to compare job shop and lean work cell considering transportations

A queuing theory approach to compare job shop and lean work cell considering transportations A queung theory approach to compare ob shop and lean work cell consderng transportatons ohammad oshref-javad Department of Industral and Systems Engneerng Auburn Unversty Auburn, Alabama- 36849, USA Abstract

More information

A NOTE ON A PERIODIC REVIEW INVENTORY MODEL WITH UNCERTAIN DEMAND IN A RANDOM ENVIRONMENT. Hirotaka Matsumoto and Yoshio Tabata

A NOTE ON A PERIODIC REVIEW INVENTORY MODEL WITH UNCERTAIN DEMAND IN A RANDOM ENVIRONMENT. Hirotaka Matsumoto and Yoshio Tabata Scentae Mathematcae Japoncae Onlne, Vol. 9, (23), 419 429 419 A NOTE ON A PERIODIC REVIEW INVENTORY MODEL WITH UNCERTAIN DEMAND IN A RANDOM ENVIRONMENT Hrotaka Matsumoto and Yosho Tabata Receved September

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Minimisation of the Average Response Time in a Cluster of Servers

Minimisation of the Average Response Time in a Cluster of Servers Mnmsaton of the Average Response Tme n a Cluster of Servers Valery Naumov Abstract: In ths paper, we consder task assgnment problem n a cluster of servers. We show that optmal statc task assgnment s tantamount

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

An Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

An Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

More information

Lecture 4: November 17, Part 1 Single Buffer Management

Lecture 4: November 17, Part 1 Single Buffer Management Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input

More information

A Make-to-Stock System with Multiple Customer Classes and Batch Ordering

A Make-to-Stock System with Multiple Customer Classes and Batch Ordering OPERATIONS RESEARCH Vol. 56, No. 5, September October 28, pp. 1312 132 ssn 3-364X essn 1526-5463 8 565 1312 nforms do 1.1287/opre.18.549 28 INFORMS TECHNICAL NOTE A Make-to-Stock System wth Multple Customer

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

The optimal delay of the second test is therefore approximately 210 hours earlier than =2.

The optimal delay of the second test is therefore approximately 210 hours earlier than =2. THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

An Economic Lot-Sizing Problem with Perishable Inventory and Economies of Scale Costs: Approximation Solutions and Worst Case Analysis

An Economic Lot-Sizing Problem with Perishable Inventory and Economies of Scale Costs: Approximation Solutions and Worst Case Analysis An Economc Lot-Szng Problem wth Pershable Inventory and Economes of Scale Costs: Approxmaton Solutons and Worst Case Analyss Leon Yang Chu, 1 Vernon Nng Hsu, 2 Zuo-Jun Max Shen 3 1 Department of Industral

More information

Basically, if you have a dummy dependent variable you will be estimating a probability.

Basically, if you have a dummy dependent variable you will be estimating a probability. ECON 497: Lecture Notes 13 Page 1 of 1 Metropoltan State Unversty ECON 497: Research and Forecastng Lecture Notes 13 Dummy Dependent Varable Technques Studenmund Chapter 13 Bascally, f you have a dummy

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Lecture 16 Statistical Analysis in Biomaterials Research (Part II)

Lecture 16 Statistical Analysis in Biomaterials Research (Part II) 3.051J/0.340J 1 Lecture 16 Statstcal Analyss n Bomaterals Research (Part II) C. F Dstrbuton Allows comparson of varablty of behavor between populatons usng test of hypothess: σ x = σ x amed for Brtsh statstcan

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for

More information

Bayesian predictive Configural Frequency Analysis

Bayesian predictive Configural Frequency Analysis Psychologcal Test and Assessment Modelng, Volume 54, 2012 (3), 285-292 Bayesan predctve Confgural Frequency Analyss Eduardo Gutérrez-Peña 1 Abstract Confgural Frequency Analyss s a method for cell-wse

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

A Single-Supplier, Multiple-Retailer Model with Single-Season, Multiple-Ordering Opportunities. and Fixed Ordering Cost

A Single-Supplier, Multiple-Retailer Model with Single-Season, Multiple-Ordering Opportunities. and Fixed Ordering Cost A Sngle-Suppler, Multple-Retaler Model wth Sngle-Season, Multple-Orderng Opportuntes and Fxed Orderng Cost Apurva Jan, Kamran Monzadeh, Yong-Pn Zhou Mchael G. Foster School of Busness Unversty of Washngton,

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.

More information

A new construction of 3-separable matrices via an improved decoding of Macula s construction

A new construction of 3-separable matrices via an improved decoding of Macula s construction Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

Uncertainty and auto-correlation in. Measurement

Uncertainty and auto-correlation in. Measurement Uncertanty and auto-correlaton n arxv:1707.03276v2 [physcs.data-an] 30 Dec 2017 Measurement Markus Schebl Federal Offce of Metrology and Surveyng (BEV), 1160 Venna, Austra E-mal: markus.schebl@bev.gv.at

More information

ORDER FILL RATE, LEADTIME VARIABILITY, AND ADVANCE DEMAND INFORMATION IN AN ASSEMBLE-TO-ORDER SYSTEM

ORDER FILL RATE, LEADTIME VARIABILITY, AND ADVANCE DEMAND INFORMATION IN AN ASSEMBLE-TO-ORDER SYSTEM ORDER FILL RATE, LEADTIME VARIABILITY, AND ADVANCE DEMAND INFORMATION IN AN ASSEMBLE-TO-ORDER SYSTEM YINGDONG LU IBM Research Dvson, T. J. Watson Research Center, Yorktown Heghts, New York 1598, yngdong@us.bm.com

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

Chapter 8 Indicator Variables

Chapter 8 Indicator Variables Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n

More information

The Feynman path integral

The Feynman path integral The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space

More information

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering / Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons

More information

A Bayesian Approach to Arrival Rate Forecasting for Inhomogeneous Poisson Processes for Mobile Calls

A Bayesian Approach to Arrival Rate Forecasting for Inhomogeneous Poisson Processes for Mobile Calls A Bayesan Approach to Arrval Rate Forecastng for Inhomogeneous Posson Processes for Moble Calls Mchael N. Nawar Department of Computer Engneerng Caro Unversty Caro, Egypt mchaelnawar@eee.org Amr F. Atya

More information

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy Compression. Compromise accuracy of reconstruction for increased compression. Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost

More information

Application of Queuing Theory to Waiting Time of Out-Patients in Hospitals.

Application of Queuing Theory to Waiting Time of Out-Patients in Hospitals. Applcaton of Queung Theory to Watng Tme of Out-Patents n Hosptals. R.A. Adeleke *, O.D. Ogunwale, and O.Y. Hald. Department of Mathematcal Scences, Unversty of Ado-Ekt, Ado-Ekt, Ekt State, Ngera. E-mal:

More information

Market structure and Innovation

Market structure and Innovation Market structure and Innovaton Ths presentaton s based on the paper Market structure and Innovaton authored by Glenn C. Loury, publshed n The Quarterly Journal of Economcs, Vol. 93, No.3 ( Aug 1979) I.

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Supplementary Notes for Chapter 9 Mixture Thermodynamics

Supplementary Notes for Chapter 9 Mixture Thermodynamics Supplementary Notes for Chapter 9 Mxture Thermodynamcs Key ponts Nne major topcs of Chapter 9 are revewed below: 1. Notaton and operatonal equatons for mxtures 2. PVTN EOSs for mxtures 3. General effects

More information

TCOM 501: Networking Theory & Fundamentals. Lecture 7 February 25, 2003 Prof. Yannis A. Korilis

TCOM 501: Networking Theory & Fundamentals. Lecture 7 February 25, 2003 Prof. Yannis A. Korilis TCOM 501: Networkng Theory & Fundamentals Lecture 7 February 25, 2003 Prof. Yanns A. Korls 1 7-2 Topcs Open Jackson Networks Network Flows State-Dependent Servce Rates Networks of Transmsson Lnes Klenrock

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

DETERMINATION OF UNCERTAINTY ASSOCIATED WITH QUANTIZATION ERRORS USING THE BAYESIAN APPROACH

DETERMINATION OF UNCERTAINTY ASSOCIATED WITH QUANTIZATION ERRORS USING THE BAYESIAN APPROACH Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata TC XVII IMEKO World Congress Metrology n the 3rd Mllennum June 7, 3,

More information

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs

More information

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018 MATH 5630: Dscrete Tme-Space Model Hung Phan, UMass Lowell March, 08 Newton s Law of Coolng Consder the coolng of a well strred coffee so that the temperature does not depend on space Newton s law of collng

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

More information

Introduction to Continuous-Time Markov Chains and Queueing Theory

Introduction to Continuous-Time Markov Chains and Queueing Theory Introducton to Contnuous-Tme Markov Chans and Queueng Theory From DTMC to CTMC p p 1 p 12 1 2 k-1 k p k-1,k p k-1,k k+1 p 1 p 21 p k,k-1 p k,k-1 DTMC 1. Transtons at dscrete tme steps n=,1,2, 2. Past doesn

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

Research Article Green s Theorem for Sign Data

Research Article Green s Theorem for Sign Data Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of

More information

Statistical Energy Analysis for High Frequency Acoustic Analysis with LS-DYNA

Statistical Energy Analysis for High Frequency Acoustic Analysis with LS-DYNA 14 th Internatonal Users Conference Sesson: ALE-FSI Statstcal Energy Analyss for Hgh Frequency Acoustc Analyss wth Zhe Cu 1, Yun Huang 1, Mhamed Soul 2, Tayeb Zeguar 3 1 Lvermore Software Technology Corporaton

More information

Stat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j

Stat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j Stat 642, Lecture notes for 01/27/05 18 Rate Standardzaton Contnued: Note that f T n t where T s the cumulatve follow-up tme and n s the number of subjects at rsk at the mdpont or nterval, and d s the

More information

Absorbing Markov Chain Models to Determine Optimum Process Target Levels in Production Systems with Rework and Scrapping

Absorbing Markov Chain Models to Determine Optimum Process Target Levels in Production Systems with Rework and Scrapping Archve o SID Journal o Industral Engneerng 6(00) -6 Absorbng Markov Chan Models to Determne Optmum Process Target evels n Producton Systems wth Rework and Scrappng Mohammad Saber Fallah Nezhad a, Seyed

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information