A Market-Based Mechanism for Providing Demand-Side Regulation Service Reserves
|
|
- Junior Lambert
- 5 years ago
- Views:
Transcription
1 A Market-Based Mechansm for Provdng Demand-Sde Regulaton Servce Reserves Ioanns Ch. Paschalds, Bnbn L, Mchael C. Caramans Abstract We develop a market-based mechansm that enables a buldng Smart Mcrogrd Operator (SMO) to offer regulaton servce reserves and meet the assocated oblgaton of fast response to commands ssued by the wholesale market Independent System Operator (ISO) who provdes energy and purchases reserves. The proposed market-based mechansm allows the SMO to control the behavor of nternal loads through prce sgnals and to provde feedback to the ISO. A regulaton servce reserves quantty s transacted between the SMO and the ISO for a relatvely long perod of tme (e.g., a one hour long tme-scale). Durng ths perod the ISO repeatedly requests from the SMO to decrease or ncrease ts consumpton. We model the operatonal task of selectng an optmal short tme-scale dynamc prcng polcy as a stochastc dynamc program that maxmzes average SMO and ISO utlty. We then formulate an assocated non-lnear programmng statc problem that provdes an upper bound on the optmal utlty. We study an asymptotc regme n whch ths upper bound s tght and the statc polcy provdes an effcent approxmaton of the dynamc prcng polcy. We demonstrate, verfy and valdate the proposed approach through a seres of Monte Carlo smulatons of the controlled system tme trajectores. Index Terms Electrcty demand response, electrcty regulaton servce, smart-grd, prcng, electrcty markets, welfare maxmzaton, dynamc programmng. I. INTRODUCTION We address advanced demand control n next generaton ntellgent buldngs or neghborhoods that are () equpped wth a sub-meterng and actuaton capable smart-mcrogrd accessble by occupants as well as by a Smart Mcrogrd Operator (SMO), and () connected to a cyber nfrastructure enhanced smart grd that can support close-to-real-tme power market transactons ncludng partcpants connected at the dstrbuton level. In partcular, we consder demand control for offerng capacty reserve ancllary servces to the Independent System Operator (ISO) who clears short-term power markets. In ths respect we note that fve mnute up and down capacty reserves, known as Regulaton Servce (RS) reserves, are mportant to meetng the requred energy balance and preservng power system stablty. As clean, but alas ntermttent and volatle, renewable generaton s ncreasngly ntegrated nto the grd, RS reserve requrements * Research partally supported by the NSF under grants EFRI and EFRI-13823, by the DOE under grant DE-FG52-6NA2749, by the ARO under grant W911NF , and by the ODDR&E MURI1 program under grant N Correspondng author. Dept. of Electrcal & Computer Eng., and Dvson of Systems Eng., Boston Unversty, 8 St. Mary s St., Boston, MA 2215, emal: yannsp@bu.edu, url: Dvson of Systems Eng., Boston Unversty, e-mal: lbnbn@bu.edu. Dept. of Mechancal Eng., and Dv. of Systems Eng., Boston Unversty, 15 St. Mary s St., Brooklne, MA 2446, e-mal: mcaraman@bu.edu. ncrease as well [1]. Consderng that today s RS reserves are procured smultaneously wth energy, correspond to 1% of load, and command market clearng prces comparable to the prce of energy, an ncrease n RS requrements wthout a commensurate ncrease n the supply of RS reserves may well be a show stopper for wnd generaton expanson. Snce centralzed generatng unts are today the only contrbutor of RS, enablng buldngs to offer RS and compete n the power markets promses a major contrbuton n terms of affordable RS reserve cost and lower CO 2 emssons due to the assocated adopton of clean generaton. Wholesale power markets were ntroduced n the US n the md 199 s [2]. These markets clear smultaneously energy and several types of reserve requrements. For smplcty n exposton we consder here only RS reserves. Most markets have not yet allowed the demand sde to partcpate n RS reserves. One of the ISO s, PJM, has allowed loads to partcpate n energy and reserve transactons snce 26 [3], whle other ISO s are contemplatng to follow sut. Of the exstng short-term markets we pont out brefly ([4], [5], [6], [7]) the: () day ahead markets that close at noon of the prevous day and clear energy and reserve bds for each of the 24 hours of the next day, () hour ahead adjustment markets that close an hour n advance and reveal energy and reserve prces, and () 5-mnute real-tme economc dspatch markets that determne actual ex post varable margnal cost of energy at each bus or node of the transmsson system. We assume that wth the advent of the smart grd ([8], [9]) a Load Aggregator (LA) wll be able to partcpate n power markets on a par bass wth centralzed generators. In partcular we assume that a LA wll be able to buy energy on an hourly bass at the correspondng clearng prce and sell RS reserves for whch t wll be credted at the system RS clearng prce. An ISO who procures R h KW of RS s enttled to consder t as a stand by ncrement or decrement of consumpton that t can utlze at wll n total or n part. The ISO may send commands to the RS provder to request that t modulates ts consumpton ether up or down by an amount that does not exceed R h. These requests may arrve at nter-arrval tmes of 5 seconds or longer. To observe RS reserve contractual oblgatons, the RS provder must delver the requested ncrease or decrease n ts load wth a ramp rate of R h /5 KW per mnute. The ISO typcally redspatches the power system n 5 mnute ntervals. At each 5 mnute system dspatch, the ISO schedules slower response tertary reserves so as to reset the utlzed RS reserves to ther set ponts. As a result, although not guaranteed, the RS reserve provder s trackng of ISO commands s for all
2 practcal purposes energy neutral over the long tme-scale of an hour and beyond. To meet the aforementoned contractual requrements, an SMO must be capable of controllng loads through the smart mcrogrd and a hgher decson support and communcaton layer that nteracts wth users of energy n order to adapt ther demand behavors to ISO s requests. The lower SMO layer conssts of sensng and actuaton components that collect buldng state nformaton and actuate so as to safely mplement goals determned at the hgher level and authorzed by buldng occupants. Ths paper focuses expressly on provdng the hgher decson support layer wth a vrtual market that operates on the buldng sde of the meter for the purpose of elctng a collaboratve response of buldng occupants. Our objectve s to derve an optmal SMO prcng or ncentve polcy towards buldng occupants so that they consent to the sale of RS reserves to the ISO and collaborate n meetng ISO s RS utlzaton requrements. To the best of our knowledge, lttle relevant work has been publshed, and we are the frst to propose such a market based polcy for demand control amng at the provson of RS reserves. Methodologcally, related technques have been used n prcng Internet servces [1], [11]. In Sec. II, we detal our nternal market based model and formulate a related welfare maxmzaton problem. In Sec. III we cast the problem nto a Dynamc Programmng (DP) framework to obtan the optmal dynamc polcy. We then proceed to develop performance bounds and approxmatons. In Sec. IV we develop a statc polcy and n Sec. V we derve an easly computable upper bound on the optmal performance. Based on ths bound, we establsh n Sec. VI the asymptotc optmalty of the statc polcy as the load class specfc consumpton level becomes smaller wth a commensurate ncrease n the number of actve loads. Further, we extend the asymptotc optmalty results to account for constrants that model energy neutralty over the long tme-scale and the upper t n the RS delvery requested by the ISO. We present numercal results n Sec. VII, and conclude n Sec. VIII. II. PROBLEM FORMULATION Ths secton models the short tme-scale nteracton of the SMO wth mcrogrd occupants/loads and the ISO n conjuncton wth RS reserves. The SMO can sell R h KW of regulaton servce for the duraton of the long tme-scale (e.g., one hour), provded that ts mcrogrd s average consumpton, R, exceeds R h and ts consumpton capacty s at least R + R h. We envson mcrogrd load classes that can be potentally actve durng the relevant long tme perod to nclude, among others, lghts, HVAC zones, computers, electrcal applances and the lke. We denote the event of a load unt becomng actve as an nternal arrval (.e., nternal to the buldng) and assocate a class-specfc electrcty demand ncrement wth each arrval. We smlarly denote the event of a load unt becomng nactve as an nternal departure. An actvely consumng load unt derves a postve utlty. Wth the sale of R h KW of RS the SMO agrees to be on standby and respond to short tme-scale (e.g., seconds to mnutes) ISO requests for an ncrement or decrement of the buldng s consumpton. We denote the event of an ISO request as an external arrval (.e., external to the buldng). The termnaton of an ISO request s modeled as an external departure. Note that the cumulatve ISO ncrement or decrement requests can not exceed R h or R h respectvely. As mentoned, the SMO s response does not have to be nstantaneous. It must adhere, however, to a response rate of roughly R h /5 KW per mnute. ISO requests that are met by the SMO result n postve utlty. In addton, n ts perodc 5 mnute system re-dspatch, the ISO typcally attempts to reset ts cumulatve ncrement or decrement requests to zero n order to enable RS provders to respond to new requests durng future nter-dspatch 5 mnute perods. Ths suggests that the long tme-scale average devaton of buldng consumpton from ts R level equals zero. Hence, the sale of RS reserves has an energy neutral mpact on long tme-scale buldng consumpton. The prmary objectve s to maxmze the sum of SMO and ISO welfare assocated wth nternal and external arrvals. Hard and soft constrants are added to model adherence to the contractual requrements and long tme-scale energy neutralty descrbed above. To acheve these goals, the SMO controls the actve nternal loads and external requests by communcatng external and nternal-class-specfc prces that may be nterpreted as dynamc demand control and RS actvaton feedback sgnals as much as a monetary exchange. We assume M classes of nternal loads = 1,...,M, that arrve accordng to a Posson process and requre r KW for an exponentally dstrbuted perod wth rate µ. Let µ = (µ 1,...,µ M ). Each nternal arrval of class pays an SMO determned prce u ; we defne u = (u 1,...,u M ). We assume that the arrval rate of class loads s a known demand functon λ (u ) whch depends on u and satsfes Assumpton A below. We denote the number of actve class nternal loads at tme t by n (t), = 1,...,M, and defne N(t) = ( n 1 (t),...,n M (t) ). Assumpton A For every, there exsts a prce u,max beyond whch the demand λ (u ) becomes zero. Furthermore, the functon λ (u ) s contnuous and strctly decreasng n the range u [,u,max ]. ISO requests for the dynamc actvaton of RS reserves are modeled as a specal external class. External RS actvaton requests occur at a rate a(y) where y s an SMO set prce and a(y) satsfes Assumpton B below. Whle they are actve, external arrvals requre r e KW each. They become nactve upon ther departure whch follows an exponental dstrbuton wth rate d. Denotng the number of actve external class loads at tme t by m(t), we can express the request for ncreased or decreased buldng energy consumpton as R+R h m(t)r e. We mpose the followng two constrants: M N(t) r + m(t)r e = n (t)r + m(t)r e R + R h, (1) m(t)r e 2R h, (2)
3 where prme denotes transpose. Inequalty (1) ensures that at any tme t the total capacty usage of all actve loads does not exceed the maxmal buldng consumpton capacty. Inequalty (2) ensures that the ISO can not request that the average buldng consumpton R be ncreased beyond R+R h or decreased below R R h. Assumpton B There exsts a prce y max beyond whch the demand a(y) becomes zero. Furthermore, the functon a(y) s contnuous and strctly decreasng n the range y [,y max ]. To render the proposed constraned welfare maxmzaton problem more meanngful, we frst detal the arrval models and the underlyng demand functons. An arrval of an nternal load of class generates utlty U, where U s a non-negatve random varable takng values n the range [,u,max ] wth a contnuous probablty densty functon f (u ). Arrvals of nternal class loads are a fracton of potental class arrvals generated accordng to a Posson process wth constant rate λ,max. A potental arrval becomes a real arrval f and only f the random utlty realzaton, U, exceeds the SMO set prce u. Ths mples that nternal class arrvals occur accordng to a randomly modulated Posson process wth rate λ (u (t)) = λ,max P[U u (t)]. Furthermore, the expected utlty condtoned on the fact that a potental arrval has been accepted under a current prce of u, s equal to E[U U u ]. We therefore conclude that the expected long-term average rate at whch utlty s generated by the arrval of nternal loads s gven by: 1 T T M [ T ] E λ (u (t))e[u U u (t)]dt. Followng a smlar argument, the welfare generated from external RS class arrvals can be expressed as: [ 1 T ] T T E a(y(t))e[y Y y(t)]dt, where Y stands for the welfare from the admsson of a potental external RS arrval, and a(y(t)) = a max P[Y y(t)] where a max s the maxmal arrval rate of the external RS class. An nterestng nterpretaton of the long-term average utlty generated by external RS class arrvals s that t represents the reservaton reward level that the ISO mght be wllng to pay the SMO for standby RS reserves. Fnally, recall that buldng response to actve ISO RS requests mples that the modfed buldng load must equal R + R h m(t)r e. Ths s to avod complance by energy dumpng, and we mpose the followng penalty: [ 1 T ( (R T T E ) ( M ) ) ] P + Rh n (t)r +m(t)r e dt, where P( ) denotes the penalty functon. We make specfc assumptons on P(x) later. The optmal prcng polcy can now be descrbed as the arg max of: 1 T T E [ M T λ (u (t))e[u U u (t)]dt T + T a(y(t))e[y Y y(t)]dt ( (R ) ( M P + Rh ) ) ] n (t)r + m(t)r e dt. (3) Due to Assumpton A and B, functons λ (u ) and a(y) have nverse functons whch we denote by u (λ ) and y(a), respectvely. The nverse functons are defned on [,λ,max ] and [,a ], respectvely, and are contnuous and strctly decreasng. Ths allows us to use the arrval rates λ and a as the SMO s decson varables and wrte the nstantaneous reward rates as λ E[U U u (λ )] and ae[y Y y(a)]. III. DYNAMIC PROGRAMMING FORMULATION The problem ntroduced n Sec. II s n fact a fnte-state, contnuous-tme, average reward DP problem. Note that the set {U,Y } = {(u,y) u u,max, ;y y max } s compact and that all states communcate assurng that there exsts a (proper) polcy that s assocated wth fnte frst passage tme from any state (N,m) to any other state (N,m ). Standard DP theory results assert that an optmal statonary polcy exsts [12]. Snce the process (N(t), m(t)) s a contnuous-tme Markov chan and the total transton rate out of any state s bounded by ν = M (λ,max+µ (R+R h )/r )+(a max + d (R+2R h )/r e ), we can unformze ths Markov chan and derve the followng Bellman [ equaton [12]: J + h(n,m) = max λ (u )E[U U u ] u U C(N,m) ( (R ) ( ) +1 D(N,m) a(y)e[y Y y] P + Rh N r ) + mr e + λ (u ) M n µ h(n + e,m) + ν ν h(n e,m) C(N,M) a(y) md + 1 D(N,m) h(n,m + 1) + h(n,m 1) ν ν + (1 λ (u ) M n µ ν ν C(N,M) a(y) 1 D(N,m) md ) ] h(n, m). (4) ν ν Here, C(N,m) = { (N + e ) r + mr e R + R h } s the set of nternal class arrvals that can be admtted n state (N,m), D(N,m) = {(N,m) N r + (m + 1)r e R + R h, (m+1)r e 2R h } descrbe the condtons under whch external RS class arrvals can be admtted to the system, and 1 A denotes the ndcator of some set A. The above Bellman equaton has a unque soluton J and h( ) for an arbtrarly selected specal state, say at whch we specfy the value of the dfferental cost functon, for example h() = [12]. The scalar J stands for the optmal expected socal welfare per unt and h(n,m) denotes the relatve reward n state (N, m). Soluton of Bellman s equaton yelds an optmal polcy that maps any state (N,m) to the optmal prce vector (u, y) that maxmzes the rght-hand sde of Equaton (4). Unfortunately, the curse of dmensonalty stpulates that Bellman s equaton s only solvable for a small state space. We therefore seek a near optmal soluton that s applcable to
4 SMO s managng relatvely large buldngs or neghborhoods wth a large populaton of nternal loads. IV. STATIC PRICING POLICY We consder a statc prcng polcy, namely a fxed prce vector (u, y) ndependent of the system state, for two reasons: (1) the computaton effort of solvng for optmal dynamc prces ncreases exponentally n the number of classes and actve loads, and (2) good statc prces can be constructed tractably and under reasonable condtons lead to reasonable behaved provson of RS. Indeed, under a statc prcng polcy (u, y), the system evolves as a contnuoustme Markov chan wth correspondng average welfare: J ( (u,y) ) M = λ (u )E[U U u ] ( 1 P loss[(u,y)] ) + a(y)e[y Y y] ( 1 Q loss [(u,y)] ) [ E P ((R + R h ) ( ) )] n r + mr e, (5) where P loss [(u,y)] denotes the steady-state probablty P[N r+r +mr e > R+R h ] that an nternal class arrval s rejected, and Q loss [(u,y)] denotes the steady-state probablty P[N r + (m + 1)r e > R + R h or (m + 1)r e > 2R h ] that an external RS class arrval s rejected. Moreover, the expected penalty cost s also gven by the steady-state probablty assocated wth the same statc polcy (u, y). The optmal statc welfare s defned by J s = max J( (u,y) ), (6) (u,y) {U,Y } and the followng proposton holds. Proposton IV.1 J s J. V. OPTIMAL PERFORMANCE UPPER BOUND In ths secton we develop an upper bound on J and use t to quantfy the suboptmalty of the statc polcy. Usng the nverse demand functons u (λ ), and nternal class arrval rate λ, the nstantaneous reward rate s F (λ ) = λ E[U U u (λ )]. Smlarly, G(y) = ae[y Y y(a)]. Assume that the functons F and G are concave. Let J ub be the optmal value of the followng Non- Lnear Programmng (NLP) problem: max F (λ ) + G(a) (7) P ((R + R h ) ( ) ) n r + mr e s.t. λ = µ n, a = dm n r + mr e R + R h mr e 2R h. Remark: The non-negatvty constrants n and m are gnored here. Notce that the departure rates µ and d are postve, and the arrval rates λ and a are also non negatve by defnton. Thus n and m are also non-negatve under well-defned demand functons. Proposton V.1 If the functons F (λ ) and G(a) are concave and P( ) s convex, then J J ub. Proof: The proof s smlar to a result n [1] and s omtted. The optmal soluton of NLP (7) provdes an upper bound for the optmal socal welfare. Moreover, f the objectve functon of (7) s concave, the NLP s very easy to solve. VI. ASYMPTOTIC BEHAVIOR In ths secton, we consder an asymptotc regme and dscuss how to derve the optmal polcy whle satsfyng addtonal system behavor requrements. A. Many Small Loads If R and R h are large relatve to the requred power of a typcal arrval, we expect that the laws of large numbers wll domnate, attenuate statstcal fluctuatons, and allow us to carry out an essental determnstc analyss. To capture a stuaton of ths nature, we start wth a base system characterzed by fnte capacty R and R h and fnte demand functons λ (u ). We then scale the system through a proportonal ncrease of capacty and demand. More specfcally, let c 1 be a scalng factor. The scaled system has resources R c +Rh c, wth Rc +Rh c = cr+cr h, and demand functons λ c (u ), a c j (y j) gven by λ c (u ) = cλ (u ) and a c (y) = ca(y). Note that the other parameters r, µ, and r e, d are held fxed. We wll use a superscrpt c to denote varous quanttes of nterest n the scaled system. In ths case, consder the NLP problem (7). The upper bound Jub c s obtaned by maxmzng cλ (u )E[U U u ] + ca(y)e[y Y y] ( (cr ) ( P + crh cλ (u ) cλ (u ) r + ca µ d r ) ) e, subject to the constrants µ r + ca(y) d r e cr+cr h and ca(y) d r e 2cR h. It can seen that, f the penalty functon P( ) s lnear, then the optmal soluton for (7), denoted by u ub = (u ub,1,...,u ub,m ) and y ub, s ndependent of c, and Jc ub = cjub 1. We summarze n the followng assumpton the property of the penalty functon. Assumpton C P(Kx) = Kx for some K >. We summarze the above result as follows: Proposton VI.1 Under Assumpton C, the optmal objectve value of (7) n the scaled system ncreases lnearly wth c,.e., J c ub = cj1 ub. We are nterested n determnng the gap between the two bounds derved n Sec. IV and Sec. V. We show that n the regme of many small users, the followng result holds:
5 Theorem VI.2 Assume that functons F (λ ) and G(a) are concave, and Assumptons A, B, and C hold. Then, 1 1 c c Jc s = c c J,c 1 = c c c Jc ub. (8) Proof: The proof s omtted due to space tatons. In the next two subsectons, whle stayng n the regme of many small loads, we extend the asymptotc optmalty results to accommodate addtonal system behavor requrements. B. Energy Neutralty We mpose energy neutralty,.e., requre the long-term average cumulatve actve requests of the external RS class to equal R h. We show that energy neutralty can be acheved f the SMO can approprately nfluence the demand functon of the RS class. We assume lnear demand λ (u ) = λ,max (1 and a(y) = a max (1 y y max ). Suppose that the welfare U s unformly dstrbuted on [,u,max ] and Y s unformly dstrbuted on [,y max ].Then, F (λ ) = u,max (λ u u,max ) λ2 2λ,max ) and G(a) = y max (a a2 2a max ) are concave n λ and a, respectvely. The NLP (7) can now be wrtten as: mn λ2 a2 u,max (λ ) y max (a ) 2λ,max 2a max + K ((R + R h ) ( λ r + a µ d r ) ) e λ s.t. r + a µ d r e R + R h, a d r e 2R h. (9) For ease of exposton but wthout loss of generalty, we consder next a system nvolvng 2 nternal and 1 external RS class. Note that the NLP problem (9) can be re-formulated nto the followng Quadratc Programmng (QP) problem: u 1,max λ 1,max mn 1 2 [λ u 1 λ 2 a] 2,max λ 2,max λ 2 y max a a max K r1 T u 1 u 1,max λ 1 + K r2 u 2 u 2,max λ 2 K re d a max a [ r1 r 2 r ] λ 1 [ ] s.t. µ 1 µ 2 λ 2 R + Rh. (1) edred 2R a h The dual of (1) s also a QP problem. We denote the optmal soluton of the prmal QP (1) by (λ 1,λ 2,a ), and the optmal soluton of the dual QP by (q1,q 2). Under energy neutralty, the long-term average of actve external RS class requests s R h,.e., r e a /d = R h. By complementary slackness, we have the followng optmalty condtons: y max (1 1 a max dr h ) = λ 1,max r λ e 1,max u 1,max r2 1 µ 2 1 r 1 µ 1 + λ 2,max r 2 λ 1 µ 2 R + λ2,max u 2,max r2 2 µ 2 2 re d, r 1 r 2 r e R + R h λ 1,max + λ 2,max + a max µ 1 µ 2 d, r 1 r 2 R λ 1,max + λ 2,max. (11) µ 1 µ 2 Under condtons (11), the optmal socal welfare s: ( ) 2 1 r λ 1 r 1,max µ 1 + λ 2 r 2,max µ 2 + a ed max (R + R h ) 2 λ 1,max u 1,max r2 1 + λ2,max µ 2 1 u 2,max r2 2 + amax µ 2 2 y max r2 e d λ 1,maxu 1,max λ 2,maxu 2,max a maxy max. (12) We summarze the above result as follows: Proposton VI.3 Gven (11), n the regme of many small loads, the long-term average of actve requests of the external RS class s R h, and the optmal performance s gven by (12). VII. NUMERICAL EXPERIMENTS In ths secton, we report numercal experments that verfy and valdate our results. Assume that the SMO can support a maxmal consumpton of 12 KW wth R = 1 KW and R h = 2 KW. Ths consumpton s consstent wth the Boston Unversty (BU) Photoncs buldng housng the offce of the frst two co-authors. Consder two nternal classes characterzed by (all arrval rates are n arrvals/mnute and departure rates n departures/mnute): λ 1 (u 1 ) = 16 8u 1, λ 2 (u 2 ) = 8 8u 2, u 1,max = 2, u 2,max = 1, λ 1,max = 16, λ 2,max = 8, r 1 = 2 KW, r 2 = 1 KW, µ 1 = 1, µ 2 = 2. The RS class arrval rate s: a(y) = 1(1 y/y max ) wth y max to be determned, a max = 1, r e = 1 KW, d = 2. The penalty functon has a slope of K = 1. Assume that the socal welfare U s unformly dstrbuted on [,u,max ] and Y s unformly dstrbuted on [,y,max ]. Wth these values we can solve the NLP problem (9) and obtan asymptotcally optmal statc prces. Consder a typcal regulaton servce cycle consstng of three 5-mnute perods. Each cycle starts wth a full RS standby state, namely, wth all RS actve loads totallng R h. Ths s the result of the ISO 5 mnute dspatch whch we model by tunng the value of y max. In the followng two perods wthn the cycle, ISO requests are modeled as random samples from a unform dstrbuton over [,2R h ] whch are nstantated by settng the correspondng value of y max. Ths random cycle s statstcally neutral over the long tme-scale. In ths experment, y max changes every 5 mnutes and the SMO must control nternal class loads to meet ISO requests wthn the 5 mnute requrement of RS reserves. By formulatng and solvng the NLP problem (9) at the begnnng of every perod, the SMO s able to approprately set the prces that result n the requred arrvals of nternal classes. We smulate the system for the long tme-scale of one hour consstng of 12 perods of 5 mnutes each and report the results below. The steady-state arrval rates for the two nternal classes and the RS class n these perods are shown n Tab. I. The evoluton of the total consumpton due to nternal loads and the total load of the RS class are shown n Fg. 1. Note
6 TABLE I THE ARRIVAL RATES OF INTERNAL CLASSES AND THE RS CLASS. Perod Internal class 1 Internal class 2 RS class Fg. 2. Number of actve nternal loads and actve RS requests. of electrc energy, but also n the provson of fast reserves. In ths paper we develop and test a market based approach for a Smart Mcrogrd Operator (SMO) to control numerous and dverse loads and provde such servces. We start by formulatng a detaled dynamc optmal control problem and then derve an assocated tractable and yet near optmal nonlnear optmzaton model that s capable of determnng both short term (at the mnutes tme-scale) operatonal decson support to the SMO as well as longer tme-scale transacton quanttes (at the hourly tme-scale). Our model s elaborated and valdated by numercal smulaton results. Fg. 1. Energy consumpton by nternal classes and actve RS requests. that by applyng statc prcng polces that are pece-wse constant over each 5-mnute perod, nternal loads converge to the ISO request. Recallng that RS reserves are requred to respond wth a ramp of R h /5 KW per mnute, the response of nternal class loads conforms well to requrements. Indeed, snce R h = 2 KW n ths example, the rate at whch n 1 (t)r 1 + n 2 (t)r 2 + m(t)r e move away from and then approach the 12 KW level should be close to 4 KW per mnute. Fgure 1 demonstrates ths to be the case. The SMO s decson to offer 2 KW of RS s consstent wth ts capablty to perform accordng to the assocated contractual requrements. In Fgure 2, where we plot the number of nternal loads and RS requests, we note that there are on average 35 actve loads of class 1 wth a 2 KW consumpton rate these mght be HVAC heatng zone loads and 25 actve loads of class 2 wth a 1 KW consumpton rate. These quanttes are consstent wth the BU Photoncs buldng whch features several hundred heatng zones. VIII. CONCLUSIONS The prospect of a paradgm shft n the capabltes of the electrc power grd as well as buldng sde of the meter mcrogrds through cyber-physcal system (CPS) nfrastructure development s wthn sght. Such CPS nfrastructure wll certanly enable loads to partcpate n power markets on a par bass wth generatng unts, not only n the provson REFERENCES [1] Y. V. Makarov, C. Loutan, J. Ma, and P. de Mello, Operatonal mpacts of wnd generaton on Calforna power systems, IEEE Transactons on Power Systems, vol. 24, no. 2, pp , 29. [2] P. Joskow, Markets for power n the Unted States: An nterm assessment, The Energy Journal, vol. 38, pp. 1 36, 26. [3] Whte Paper on Integratng Demand and Response nto the PJM Ancllary Servce Markets, Febuary 25. [4] M. Bryson, PJM Manual 12: Balancng Opertons, Revson 16, November 27. [5] B. Kranz, R. Pke, and E. Hrst, Integrated electrcty markets n New York, The Electrcty Journal, vol. 16, no. 2, pp , 23. [6] NYISO Day-Ahead Schedulng Manual 11, June 21. [7] A. L. Ott, Experence wth PJM market operaton, system desgn, and mplementaton, IEEE Transactons on Power Systems, no. 2, pp , 23. [8] NIST Framework and Roadmap for Smart Grd Interoperablty Standards, Release 1., January 21. [9] R. Tabors, G. Parker, and M. Caramans, Development of the smart grd: Mssng elements n the polcy process, n 43rd Hawa Internatonal Conference on System Scences (HICSS), January 21, pp [1] I. C. Paschalds and J. N. Tstskls, Congeston dependent prcng of network servces, IEEE/ACM Trans. Networkng, vol. 8, no. 2, pp , 2. [11] I. Paschalds and Y. Lu, Prcng n multservce loss networks: Statc prcng, asymptotc optmalty, and demand substtuton effects, IEEE/ACM Trans. Networkng, vol. 1, no. 3, pp , 22. [12] D. P. Bertsekas, Dynamc Programmng and Optmal Control. Athena Scentfc, 1995, vol. II.
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 informationk t+1 + c t A t k t, t=0
Macro II (UC3M, MA/PhD Econ) Professor: Matthas Kredler Fnal Exam 6 May 208 You have 50 mnutes to complete the exam There are 80 ponts n total The exam has 4 pages If somethng n the queston s unclear,
More informationResource 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 informationECE559VV 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 informationWelfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?
APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare
More informationAssortment 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 informationOnline 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 informationEEL 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 informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationEcon107 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 informationSimultaneous 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 information3.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 informationNotes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology
Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,).
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationPricing and Resource Allocation Game Theoretic Models
Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationCHAPTER 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 informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationCollege 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 informationTCOM 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 informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationQueueing 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 informationUniversity of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D.
Unversty of Calforna, Davs Date: June 22, 29 Department of Agrcultural and Resource Economcs Department of Economcs Tme: 5 hours Mcroeconomcs Readng Tme: 2 mnutes PRELIMIARY EXAMIATIO FOR THE Ph.D. DEGREE
More informationThe 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 informationCOMPARISON 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 informationMASSACHUSETTS 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 informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More information6. Stochastic processes (2)
6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process
More information6. Stochastic processes (2)
Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationMarkov 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 informationLOW 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 informationEconomics 2450A: Public Economics Section 10: Education Policies and Simpler Theory of Capital Taxation
Economcs 2450A: Publc Economcs Secton 10: Educaton Polces and Smpler Theory of Captal Taxaton Matteo Parads November 14, 2016 In ths secton we study educaton polces n a smplfed verson of framework analyzed
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationLecture 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 informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationForesighted Demand Side Management
Foresghted Demand Sde Management 1 Yuanzhang Xao and Mhaela van der Schaar, Fellow, IEEE Department of Electrcal Engneerng, UCLA. {yxao,mhaela}@ee.ucla.edu. Abstract arxv:1401.2185v1 [cs.ma] 9 Jan 2014
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
More informationThe 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 informationEquilibrium with Complete Markets. Instructor: Dmytro Hryshko
Equlbrum wth Complete Markets Instructor: Dmytro Hryshko 1 / 33 Readngs Ljungqvst and Sargent. Recursve Macroeconomc Theory. MIT Press. Chapter 8. 2 / 33 Equlbrum n pure exchange, nfnte horzon economes,
More information2E 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 informationUncertainty 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 informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationUncertainty 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 informationHow Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *
How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton
More informationApplied Stochastic Processes
STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of
More informationChapter 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 informationKernel 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 informationA 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 informationTopics in Probability Theory and Stochastic Processes Steven R. Dunbar. Classes of States and Stationary Distributions
Steven R. Dunbar Department of Mathematcs 203 Avery Hall Unversty of Nebraska-Lncoln Lncoln, NE 68588-0130 http://www.math.unl.edu Voce: 402-472-3731 Fax: 402-472-8466 Topcs n Probablty Theory and Stochastc
More informationTemperature. Chapter Heat Engine
Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the
More informationApplication 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 informationModule 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 informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationLecture 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 informationOnline Appendix: Reciprocity with Many Goods
T D T A : O A Kyle Bagwell Stanford Unversty and NBER Robert W. Stager Dartmouth College and NBER March 2016 Abstract Ths onlne Appendx extends to a many-good settng the man features of recprocty emphaszed
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationCS286r Assign One. Answer Key
CS286r Assgn One Answer Key 1 Game theory 1.1 1.1.1 Let off-equlbrum strateges also be that people contnue to play n Nash equlbrum. Devatng from any Nash equlbrum s a weakly domnated strategy. That s,
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationDynamic Pricing for Smart Grid with Reinforcement Learning
Dynamc Prcng for Smart Grd wth Renforcement Learnng Byung-Gook Km, Yu Zhang, Mhaela van der Schaar, and Jang-Won Lee Samsung Electroncs, Suwon, Korea Department of Electrcal Engneerng, UCLA, Los Angeles,
More information1 The Sidrauski model
The Sdrausk model There are many ways to brng money nto the macroeconomc debate. Among the fundamental ssues n economcs the treatment of money s probably the LESS satsfactory and there s very lttle agreement
More informationHila Etzion. Min-Seok Pang
RESERCH RTICLE COPLEENTRY ONLINE SERVICES IN COPETITIVE RKETS: INTINING PROFITILITY IN THE PRESENCE OF NETWORK EFFECTS Hla Etzon Department of Technology and Operatons, Stephen. Ross School of usness,
More informationEndogenous timing in a mixed oligopoly consisting of a single public firm and foreign competitors. Abstract
Endogenous tmng n a mxed olgopoly consstng o a sngle publc rm and oregn compettors Yuanzhu Lu Chna Economcs and Management Academy, Central Unversty o Fnance and Economcs Abstract We nvestgate endogenous
More informationLecture 17 : Stochastic Processes II
: Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss
More informationLecture 4. Instructor: Haipeng Luo
Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationInner 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 informationExperience with Automatic Generation Control (AGC) Dynamic Simulation in PSS E
Semens Industry, Inc. Power Technology Issue 113 Experence wth Automatc Generaton Control (AGC) Dynamc Smulaton n PSS E Lu Wang, Ph.D. Staff Software Engneer lu_wang@semens.com Dngguo Chen, Ph.D. Staff
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationStructure 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 informationThe 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 informationPROBLEM SET 7 GENERAL EQUILIBRIUM
PROBLEM SET 7 GENERAL EQUILIBRIUM Queston a Defnton: An Arrow-Debreu Compettve Equlbrum s a vector of prces {p t } and allocatons {c t, c 2 t } whch satsfes ( Gven {p t }, c t maxmzes βt ln c t subject
More informationConjectures in Cournot Duopoly under Cost Uncertainty
Conjectures n Cournot Duopoly under Cost Uncertanty Suyeol Ryu and Iltae Km * Ths paper presents a Cournot duopoly model based on a condton when frms are facng cost uncertanty under rsk neutralty and rsk
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationOpen Systems: Chemical Potential and Partial Molar Quantities Chemical Potential
Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,
More informationDUE: 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 informationA 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 informationCredit Card Pricing and Impact of Adverse Selection
Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n
More informationLab 2e Thermal System Response and Effective Heat Transfer Coefficient
58:080 Expermental Engneerng 1 OBJECTIVE Lab 2e Thermal System Response and Effectve Heat Transfer Coeffcent Warnng: though the experment has educatonal objectves (to learn about bolng heat transfer, etc.),
More informationJoint Scheduling and Power-Allocation for Interference Management in Wireless Networks
Jont Schedulng and Power-Allocaton for Interference Management n Wreless Networks Xn Lu *, Edwn K. P. Chong, and Ness B. Shroff * * School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,
More informationMore 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 informationf(x,y) = (4(x 2 4)x,2y) = 0 H(x,y) =
Problem Set 3: Unconstraned mzaton n R N. () Fnd all crtcal ponts of f(x,y) (x 4) +y and show whch are ma and whch are mnma. () Fnd all crtcal ponts of f(x,y) (y x ) x and show whch are ma and whch are
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationMaximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method
Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC
More informationThe 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 informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationLecture 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 informationLinear 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 informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More information(1 ) (1 ) 0 (1 ) (1 ) 0
Appendx A Appendx A contans proofs for resubmsson "Contractng Informaton Securty n the Presence of Double oral Hazard" Proof of Lemma 1: Assume that, to the contrary, BS efforts are achevable under a blateral
More informationSupporting Information for: Two Monetary Models with Alternating Markets
Supportng Informaton for: Two Monetary Models wth Alternatng Markets Gabrele Camera Chapman Unversty & Unversty of Basel YL Chen St. Lous Fed November 2015 1 Optmal choces n the CIA model On date t, gven
More informationGlobal 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 informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationElectrical double layer: revisit based on boundary conditions
Electrcal double layer: revst based on boundary condtons Jong U. Km Department of Electrcal and Computer Engneerng, Texas A&M Unversty College Staton, TX 77843-318, USA Abstract The electrcal double layer
More informationMinimisation 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