Congestion Management in Restructured Power Systems Using an Optimal Power Flow Framework

Size: px
Start display at page:

Download "Congestion Management in Restructured Power Systems Using an Optimal Power Flow Framework"

Transcription

1 PSERC Congeston Management n Restructured Power Systems Usng an Optmal Power Flow Framework Masters Thess and Proect Report Power Systems Engneerng Research Center A Natonal Scence Foundaton Industry/Unversty Cooperatve Research Center snce 1996

2 Power Systems Engneerng Research Center Congeston Management n Restructured Power Systems Usng an Optmal Power Flow Framework Masters Thess and Proect Report A.S. Nayak and M.A. Pa Unversty of Illnos at Urbana-Champagn PSERC Publcaton 0-3 May 00

3 Informaton about ths Report For nformaton about ths report contact: M.A. Pa Professor Electrcal and Computer Engneerng Unversty of Illnos at Urbana-Champagn 345 Evertt Lab 1406 W. Green Street Urbana, IL Phone: Fax: Emal: Power Systems Engneerng Research Center Ths s a proect report from the Power Systems Engneerng Research Center (PSERC). It s avalable on the PSERC webste, The PSERC publcaton number s 0-3. For addtonal nformaton, contact: Power Systems Engneerng Research Center Cornell Unversty 48 Phllps Hall Ithaca, New York Phone: Fax: PSERC s a mult-unversty center for research and educaton on challenges facng the electrc power ndustry. Informaton about PSERC can be found at the above webste address. Notce Concernng Copyrght Materal Permsson to copy wthout fee all or part of ths publcaton s granted f approprate attrbuton s gven to ths document as the source materal. 00 Unversty of Illnos. All rghts reserved.

4 Acknowledgements The work descrbed n ths report was sponsored by the Power Systems Engneerng Research Center (PSERC). It s one of the research products from the PSERC proect New System Control Methodologes. The proect leader s Chrs DeMarco from the Unversty of Wsconsn-Madson. Proect team members nclude Ian Dobson (Unversty of Wsconsn- Madson), M. A. Pa (Unversty of Illnos at Urbana/Champagn) and Ian Hskens (Unversty of Illnos at Urbana-Champagn). We express our apprecaton for the support provded by PSERC s ndustral members and by the Natonal Scence Foundaton under grant NSF EEC receved under the Industry/Unversty Cooperatve Research Center program. We would also lke to acknowledge the support of the Granger Foundaton.

5 Executve Summary The restructurng of the electrc power ndustry has nvolved paradgm shfts n the real-tme control actvtes of the power grds. Managng dspatch s one of the mportant control actvtes n a power system. Optmal power flow (OPF) has perhaps been the most sgnfcant technque for obtanng mnmum cost generaton patterns n a power system wth exstng transmsson and operatonal constrants. In ths report we look at a modfed OPF whose obectve s to mnmze the absolute MW of reschedulng. In ths framework, we also consder dspatchng blateral contracts n case of serous congeston, wth the knowledge that any change n a blateral contract s equvalent to modfyng the power nectons at both the buyer and the seller buses. Ths hghlghts the fact that, n a restructured scenaro, contracts between tradng enttes must be consdered as system decson varables (n addton to the usual generaton, loads and flows). The dspatch problem has been formulated wth two dfferent obectve functons: cost mnmzaton and mnmzaton of transacton devatons. Congeston charges can be computed n both the cases. In a pool market mode, the sellers (compettve generators) may submt ther ncremental and decremental bd prces n a real-tme balancng market. These can then be ncorporated n the OPF problem to yeld the ncremental/decremental change n the generator outputs. Smlarly, n the case of the blateral market mode, every transacton contract may nclude a compensaton prce that the buyer-seller par s wllng to accept should ts transacton be curtaled. Ths can then be modeled as a prortzaton of the transactons based on the latter s senstvtes to the volated constrant n case congeston occurs. In ths report, we also seek to develop an OPF soluton ncorporatng FACTS devces n a gven market mode (pool or blateral dspatch). FACTS devces assume mportance n the context of power system restructurng snce they can expand the usage potental of transmsson systems by controllng power flows n the network. FACTS devces are operated n a manner so as to ensure that the contractual requrements are fulflled as far as possble by mnmzng lne congeston. Varous optmzaton technques avalable n the lterature have been used to solve OPF problem.

6 Table of Contents 1 INTRODUCTION. 1 CONGESTION MANAGEMENT METHODOLOGIES. 5.1 Introducton.. 5. Vertcally Integrated Operaton 5.3 Unbundled Operaton Congeston Management Methodologes 7.5 Example of Congeston Management n an Economc Dspatch Framework 7.6 Congeston Management Usng Prcng Tools OPTIMAL DISPATCH METHODOLOGIES IN DIFFERENT MARKET STRUCTURES Introducton Pool Dspatch Pool structure Pool dspatch formulaton Example of correctve reschedulng n pool dspatch Blateral Dspatch Blateral market structure Blateral dspatch formulaton Test results Treatment of Transacton-Based Groups Dspatch formulatons Test case... 4

7 3.5 Conclusons. 9 4 OPTIMAL DISPATCH USING FACTS DEVICES IN DEREGULATED MARKET STRUCTURES Introducton Statc Modelng of FACTS Devces Thyrstor-controlled seres compensator (TCSC) Thyrstor-controlled phase angle regulator (TCPAR) Statc VAr compensator (SVC) Problem Formulaton for OPF wth FACTS Devces FACTS Devces Locatons Reducton of total system VAr power loss Selecton of optmal placement of FACTS devces Test Cases Sx-Bus system Fourteen-bus system Conclusons CONCLUSIONS AND FUTURE WORK 44 REFERENCES.. 45 v

8 1 INTRODUCTION The restructurng of the electrc power ndustry has nvolved paradgm shfts n the realtme control actvtes of the power grds. Managng dspatch s one of the mportant control actvtes n a power system. Optmal power flow (OPF) has perhaps been the most sgnfcant technque for obtanng mnmum cost generaton patterns n a power system wth exstng transmsson and operatonal constrants. The role of an ndependent system operator n a compettve market envronment would be to facltate the complete dspatch of the power that gets contracted among the market players. Wth the trend of an ncreasng number of blateral contracts beng sgned for electrcty market trades, the possblty of nsuffcent resources leadng to network congeston may be unavodable. In ths scenaro, congeston management (wthn an OPF framework) becomes an mportant ssue. Real-tme transmsson congeston can be defned as the operatng condton n whch there s not enough transmsson capablty to mplement all the traded transactons smultaneously due to some unexpected contngences. It may be allevated by ncorporatng lne capacty constrants n the dspatch and schedulng process. Ths may nvolve redspatch of generaton or load curtalment. Other possble means for relevng congeston are operaton of phase-shfters or FACTS devces. In ths report we look at a modfed OPF whose obectve s to mnmze the absolute MW of reschedulng. In ths framework, we consder dspatchng the blateral contracts too n case of serous congeston, wth the knowledge that any change n a blateral contract s equvalent to modfyng the power nectons at both the buyer and the seller buses. Ths hghlghts the fact that, n a restructured scenaro, contracts between tradng enttes must be consdered as system decson varables (n addton to the usual generaton, loads and flows). Fgure 1.1 shows a transacton network [1] n a typcal deregulated electrcty system. It dsplays lnks of data and cash flow between varous market players. In the fgure, G stands for generator-servng enttes (or gencos), D for load or demand-servng enttes (LSEs or dscos), E for marketers, and ISO for the ndependent system operator.

9 G D Informaton flow Money flow ISO E Fgure 1.1 Transacton network The dspatch problem has been formulated wth two dfferent obectve functons: cost mnmzaton and mnmzaton of transacton devatons. Congeston charges can be computed n both the cases. In a pool market mode, the sellers (compettve generators) may submt ther ncremental and decremental bddng prces n a real-tme balancng market. These can then be ncorporated n the OPF problem to yeld the ncremental/decremental change n the generator outputs. Smlarly, n case of a blateral market mode, every transacton contract may nclude a compensaton prce that the buyer-seller par s wllng to accept should ts transacton be curtaled. Ths can then be modeled as a prortzaton of the transactons based on the latter s senstvtes to the volated constrant n case congeston occurs. In ths report, we also seek to develop an OPF soluton ncorporatng FACTS devces n a gven market mode (pool or blateral dspatch). FACTS devces assume mportance n the context of power system restructurng snce they can expand the usage potental of transmsson systems by controllng power flows n the network. FACTS devces are operated n a manner so as to ensure that the contractual requrements are fulflled as far as possble by mnmzng lne congeston. Varous optmzaton technques have been used to solve OPF problems. These may be classfed as sequental, quadratc, lnear, nonlnear, nteger and dynamc programmng

10 methods, Newton-based methods, nteror pont methods, etc. Nonlnear programmng methods nvolve nonlnear obectve and constrant equatons. These make up the earlest category of OPF technques as they can closely model electrc power systems. The benchmark paper by Dommel and Tnney [] dscusses a method to mnmze fuel costs and actve power loss usng the penalty functon optmzaton approach. Dv and Kesavan [3] use an adapted Fletcher s quas-newton technque for optmzaton of shfted penalty functons. Lnear programmng deals wth problems wth constrants and obectve functon formulated n lnear forms. Sterlng and Irvng [4] solved an economc dspatch of actve power wth constrants relaxaton usng a lnear programmng approach. Chen et al. [5] developed a successve lnear programmng (SLP) based method for a loss mnmzaton obectve n an ac-dc system. In the SLP approach, the nonlnear OPF problem s approxmated to a lnear programmng problem by lnearzng both the obectve functon as well as the constrants about an operatng state. At every teraton, a suboptmal soluton s found and the varables are updated to get a new operatng state. The process s then repeated untl the obectve functon converges to an optmal level. Megahed et al. [6] have dscussed the treatment of the nonlnearly constraned dspatch problem to a seres of constraned lnear programmng problems. Smlarly, Waght et al. [7] have used the Dantzg-Wolfe decomposton method to break the dspatch problem nto one master problem and several smaller lnear programmng subproblems. Combnatons of lnear programmng methods wth the Newton approach have been dscussed n the lterature [8]. In [9], Burchett and Happ apply an optmzaton method based on transformng the orgnal problem to that of solvng a seres of lnearly constraned subproblems usng an augmented Lagrangan type obectve functon. The subproblems are optmzed usng quas-newton, conugate drectons, and steepest descent methods. Quadratc programmng s another form of nonlnear programmng where the obectve functon s approxmated by a quadratc functon and the constrants are lnearzed. Nanda et al. [10] dscuss an OPF algorthm developed usng the Fletcher s quadratc programmng method. Burchett et al. [11] dscuss a successve quadratc programmng (SQP) method where the approxmaton-soluton-update process s repeated to convergence ust as n the SLP method. In ths method, a sequence of quadratc programs s created from the exact analytcal frst and second dervatves of the 3

11 power flow equatons and the nonlnear obectve functon. Interor pont methods are farly new entrants n the feld of power system optmzaton problems. Vargas et al. [1] dscussed an nteror pont method for a securty-constraned economc dspatch problem. In [13], Momoh et al. present a quadratc nteror pont method for OPF problems, economc dspatch, and reactve power plannng. The report s organzed as follows. In Chapter we look at congeston management methodologes and how they get modfed n the new compettve framework of electrcty power markets. A smple example s gven for the calculaton of congeston charges n a scenaro where the obectve of optmzaton s to maxmze socetal beneft. In Chapter 3, we work out dfferent OPF formulatons. Obectve functons that are treated nclude cost mnmzaton and transacton curtalment mnmzaton. Market models nvolvng pool and blateral dspatches are consdered. The possblty of usng these formulatons n an open access system dspatch module and n real-tme balancng markets s dscussed. In Chapter 4, we treat the subect of ncludng FACTS devces n the OPF framework. Varous devce models are consdered and then appled n the problem formulaton. The mpact of these devces on mnmzng congeston and transacton devatons s studed. In Chapter 5, the OPF results are dsplayed on two test systems and nferences are drawn from the same. Further areas of research n ths feld are then explored n the concludng chapter. 4

12 CONGESTION MANAGEMENT METHODOLOGIES.1 Introducton In ths chapter, we look at congeston management methodologes and how they get modfed n the new compettve framework of electrcty power markets. A smple example s gven for the calculaton of congeston charges n a scenaro where the obectve of optmzaton s to maxmze socetal beneft.. Vertcally Integrated Operaton The unbundlng of the electrc power market has led to the evoluton of new organzatonal structures. Unbundlng mples openng to competton those tasks that are, n a vertcally ntegrated structure, coordnated ontly wth the obectve of mnmzng the total costs of operatng the utlty. In such a tradtonal organzatonal structure, all the control functons, lke automatc generaton control (AGC), state estmaton, generaton dspatch, unt commtment, etc., are carred out by an energy management system. Generaton s dspatched n a manner that realzes the most economc overall soluton. In such an envronment, an optmal power flow can perform the dual functon of mnmzng producton costs and of avodng congeston n a least-cost manner. Congeston management thus nvolves determnng a generaton pattern that does not volate the lne flow lmts. Lne flow capacty constrants, when ncorporated n the schedulng program, lead to ncreased margnal costs. Ths may then be used as an economc sgnal for reschedulng generaton or, n the case of recurrng congeston, for nstallaton of new generaton/transmsson facltes..3 Unbundled Operaton In a compettve power market scenaro, besdes generaton, loads, and lne flows, contracts between tradng enttes also comprse the system decson varables. The followng pool and blateral compettve structures for the electrcty market have evolved/are evolvng: 5

13 (1) Sngle aucton power pools, where wholesale sellers (compettve generators) bd to supply power n to a sngle pool. Load servng enttes (LSEs or buyers) then buy wholesale power from that pool at a regulated prce and resell t to the retal loads. () Double aucton power pools, where the sellers put n ther bds n a sngle pool and the buyers then compete wth ther offers to buy wholesale power from the pool and then resell t to the retal loads. (3) In addton to combnatons of (1) and (), blateral wholesale contracts between the wholesale generators and the LSEs wthout thrd-party nterventon. (4) Multlateral contracts,.e., purchase and sale agreements between several sellers and buyers, possbly wth the nterventon of thrd partes such as forward contractors or brokers. In both (3) and (4) the prce-quantty trades are up to the market partcpants to decde, and not the ISO. The role of the ISO n such a scenaro s to mantan system securty and carry out congeston management. The contracts, thus determned by the market condtons, are among the system nputs that drve the power system. The transactons resultng from such contracts may be treated as sets of power nectons and extractons at the seller and buyer buses, respectvely. For example, n a system of n buses, wth the generator buses numbered from 1 to m, the nodal actve powers may be represented as [14] where P D K P, k K = Ppo, + PT + loss compensaton, =1,, m (.1) K D = D po + DT K, k K = actve nected power at generator bus = actve extracted power at load bus = set of blateral / multlateral transactons,, = m+1, n (.) P po,i = pool power nected at bus D po, = pool power extracted at bus P Tk,I = power nected at bus n accordance wth transacton T K D Tk, = power extracted at bus n accordance wth transacton T K Loss compensaton = power suppled at bus by all transacton partcpants to make good the transmsson losses. 6

14 .4 Congeston Management Methodologes There are two broad paradgms that may be employed for congeston management. These are the cost-free means and the not-cost-free means [15]. The former nclude actons lke outagng of congested lnes or operaton of transformer taps, phase shfters, or FACTS devces. These means are termed as cost-free only because the margnal costs (and not the captal costs) nvolved n ther usage are nomnal. The not-cost-free means nclude: (1) Reschedulng generaton. Ths leads to generaton operaton at an equlbrum pont away from the one determned by equal ncremental costs. Mathematcal models of prcng tools may be ncorporated n the dspatch framework and the correspondng cost sgnals obtaned. These cost sgnals may be used for congeston prcng and as ndcators to the market partcpants to rearrange ther power nectons/extractons such that congeston s avoded. () Prortzaton and curtalment of loads/transactons. A parameter termed as wllngness-to-pay-to-avod-curtalment was ntroduced n [14]. Ths can be an effectve nstrument n settng the transacton curtalment strateges whch may then be ncorporated n the optmal power flow framework. In the next chapter we look at OPF formulatons ncorporatng both (1) and () above. These models can be used as part of a real-tme open access system dspatch module [16]. The functon of ths module s to modfy system dspatch to ensure secure and effcent system operaton based on the exstng operatng condton. It would use the dspatchable resources and controls subect to ther lmts and determne the requred curtalment of transactons to ensure uncongested operaton of the power system..5 Example of Congeston Management n an Economc Dspatch Framework We now look at an example of calculatng optmal bus prces and congeston costs for a power system, wheren an ndependent company (ISO) controls the transmsson network and sets nodal prces that are computed as part of a centralzed dspatch. A smple power system s consdered here for the calculaton of congeston charges. A three-bus system s shown n Fgure.1 wth generator cost/margnal cost and load beneft/margnal beneft 7

15 functons as shown. Also shown n the fgure are the maxmum lne flow lmts and lne susceptances. C 1 = P 1 $/hr MC 1 = P 1 $/MWhr G 1 G 1 P max = 5 MW b 1 = - p.u. C = 3P $/hr MC = 3.34P $/MWhr P max = 15 MW b 13 = -1.0 p.u. P max = 15 MW b 3 = -1.5 p.u. 3 B 3 = -55P 3 $/hr MB 3 = -55 $/MWhr Fgure.1 Sample power system For smplcty we make the followng approxmatons: (1) Each transmsson lne s represented by ts susceptance b. () A lossless DC power flow model s assumed;.e., the bus voltage angular dfferences are assumed to be small and the voltage magntudes approxmately 1.00 p.u. The real power flow on each lne s gven by P = δ δ ) (.3) b ( where δ and δ represent the voltage angles at buses and, respectvely. The total power necton at bus s gven by P = P (.4) As mentoned above, we solve ths problem n a centralzed dspatch framework where the obectve s to maxmze socal beneft. Ths optmzaton problem thus seeks to mnmze the system operatng costs mnus the consumer beneft, subect to the bndng 8

16 lne flow nequalty constrants and the power flow equalty constrants. The problem nvolves solvng a quadratc Lagrangan (quadratc n the decson varables and multplers). The varables are gven by z = [ P, δ, λ, µ ] (.5) where P denotes the net power nectons at all the buses δ denotes the voltage angles λ denotes the Lagrangan multplers for the equalty constrants µ denotes the multplers for the nequalty constrants. The problem may be thus stated as mn{ C1( P1 ) + C ( P ) B3 ( P3 )} P, δ (.6) subect to P = δ δ (.7) 1 3 P = 3.5δ 1.5δ (.8) 3 P = 1.5δ +.5δ (.9) 3 3 P P, P P, P P (.10) max max max In ths example, the nequalty constrant lmtng the flow on lne 1- s taken as bndng. The Lagrangan functon for ths problem may be gven as l = P + 3P + 55 P + λ ( δ δ P) + λ (3.5δ 1.5 δ P) + λ ( 1.5δ +.5 δ P) µ ( δ 5) (.11) 1 The optmalty condton s gven by l = 0 (.1) z and 9

17 T 1 T l l l ( z) = z z + z (.13) z z z=0 From equatons (.1) and (.13), t can be seen that the optmal value of z may be obtaned by solvng l l z = z z z = 0 Solvng the problem n the above example yelds the followng optmal values: (.14) z = [ ] T (.15) The Lagrange multplers λ = [ ] T can be nterpreted as the optmal nodal prces at each of the three buses n $/MWhr. In other words, f these had been used as the bus prces, the generator and load responses to these prces would have been the same as what was obtaned n the above optmal dspatch. We now compute the congeston charges (for the flow on each transmsson lne). The congeston charge may be looked upon as the nherent cost of transmttng power across the lne. A smple way to compute ths s gven here. The congeston charge c for lne s the dfference n the congeston costs c and c at buses and, respectvely;.e., c = c - c, (.16) Now, each bus nodal prce λ s made up of three components, vz., the margnal cost of generaton at the slack bus, the margnal cost of losses, and the congeston cost. Hence, C1 ( P1 ) P1 λ = + c (.17) P P where C 1 (P 1 ) s the cost functon at bus 1, whch has been consdered as the slack bus n ths example. 1 We have consdered the lossless case n ths example. Hence we have, c = λ - λ, (.18) 10

18 Thus the congeston charge for any lne may be computed as the dfference n the nodal prces between buses and. The values obtaned n ths problem are c 1 = $/MWhr, c 3 = 6.58 $/MWhr, c 13 = $/MWhr..6 Congeston Management Usng Prcng Tools In [15], Glavtsch and Alvarado dscuss congeston prcng as may be done by an ISO n the absence of nformaton on the margnal costs of the generators. The methodology suggested nvolves observng the behavor of generators under a varety of condtons, based on whch quadratc coeffcents for all generators may be nferred. In [17], Bhattacharya et al. dscuss the method of market splttng to allevate transmsson congeston. The basc prncple of ths method les n sendng prce sgnals that ether exceed or are less than the margnal costs to generators and thereby affectng a change n the generaton pattern. The market s splt nto dfferent bd areas and the area-prces are calculated for each bd area usng a capacty fee. In the next chapter we work out dfferent OPF formulatons n the varous market modes dscussed earler. 11

19 3 OPTIMAL DISPATCH METHODOLOGIES IN DIFFERENT MARKET STRUCTURES 3.1 Introducton In ths chapter, we look at ways of managng the power dspatch problem n the emergng electrcty market structures. The operatng strateges that may be used by the ISO n dfferent market modes have been explored and test cases have been studed to determne the compatblty of the strateges wth the market envronment. Emphass s placed on dealng wth congeston management. The conventonal OPF problem comprses schedulng the power system controls to optmze a gven obectve functon under a set of nonlnear nequalty constrants and equalty constrants. Under a deregulated envronment, mechansms for competton and tradng are created for the market players. Ths leads to the ntroducton of new OPF controls. In ths chapter we look at how to deal wth these controls. The fundamental entty n all compettve market structures s an ISO. Successful tradng requres that the ISO match the power bds from the supply sde (gencos) wth the offers from the demand sde (dscos). Ths s true for all market structures. The mportant way n whch market structures dffer s n the manner of the man contractual system that s followed by the market players on both the supply and demand sdes. We look at two dfferent market modes, vz., pool dspatch and blateral dspatch. 3. Pool Dspatch 3..1 Pool structure Interconnected system operaton becomes sgnfcant n a deregulated envronment. Ths s because the market players are expected to treat power transactons as commercal busness nstruments and seek to maxmze ther economc profts. Now when several gencos decde to nterchange power, complcatons may arse. An economc dspatch of the nterconnected system can be obtaned only f all the relevant nformaton, vz., generator curves, cost curves, generator lmts, commtment status, etc., s exchanged 1

20 among all the gencos. To overcome ths complex data exchange and the resultng nonoptmalty, the gencos may form a power pool regulated by a central dspatcher. The latter sets up the nterchange schedules based on the nformaton submtted to t by the gencos. Whle ths arrangement mnmzes operatng costs and facltates system-wde unt commtment, t also leads to several complextes and costs nvolved n the nteracton wth the central dspatcher. Conventonally, the optmal operaton of a power system has been based on the economc crteron of loss mnmzaton,.e., maxmzaton of socetal beneft. Pool dspatch follows the same crteron but wth certan modfcatons necesstated by the coexstence of the pool market wth a short-term electrcty spot market. Namely, these effects are demand elastctes and the varaton n the spot prce wth the purchaser s locaton on the grd. The exstence of the spot market or blateral market behnd the scene does not explctly affect the operaton of the ISO. 3.. Pool dspatch formulaton Neglectng the effects of prce elastctes and locaton, the dspatch formulaton may be stated as mn C ( PG ) B ( PD ) (3.1) P, P G D subect to g( x, u) = 0 h( x, u) 0 (3.) where g and h are the sets of system operatng constrants, ncludng system power flow equatons and lne flow lmts u s the set of control varables, vz., actve powers at the generator and load buses x s the set of dependent varables and are the set of gencos and dscos, respectvely Ths OPF uses the bds and offers submtted by the partcpants and sets the nodal prces (that are obtaned as the Lagrangan multplers), whch are n turn used to charge for the power consumpton at every node. The vectors of generaton and load are denoted as P G 13

21 and P D, respectvely. The nodal prces appled to the generaton and load controlled by players and are obtaned as a byproduct of the OPF and are represented as λ and λ, respectvely. The cost and beneft functons of each generator and load are denoted by C and B, respectvely. The cost and beneft functons are assumed to be well descrbed by quadratc functons. C ( P ) = a P + b P + c, G (3.3) D G G, G G, G G, B ( P ) = a P + b P + c, D (3.4) D, D D, D D, where G represents the set of all gencos and D represents the set of dscos. The equalty constrant may be wrtten as P D where L s the transmsson loss functon. P G + L = 0 (3.5) The capacty constrant (nequalty) may be gven as P P 0 (3.6) G G, max Problem (3.1) leads to the soluton and Kuhn-Tucker condtons gven as B P D p L hk λ ( 1+ ) + π k = 0 P P D k D C P G L hk λ ( 1 ) µ π k = 0 P P G k G µ P P ) 0 and µ 0 ( G G, max = π = 0 and π 0 (3.7) k h k where λ represents the system ncremental cost (dual multpler on the equalty constrant) and µ and π represent the sets of Kuhn-Tucker dual varables on the capacty and operatng constrants, respectvely. k 14

22 3..3 Example of correctve reschedulng n pool dspatch When the system s nsecure and there are volatons n the system, the obectve of the pool central dspatcher s to elmnate the system overload and come up wth the correctve reschedulng to elmnate the volatons as fast as possble. Mnmum operatng cost, mnmum number of controls, or mnmum shft from the optmum operaton may be used as the obectve functon. We now look at an OPF example where the obectve functon s to mnmze the reschedulng of generaton. 70 MW 0.06 G 3 1 G MW 30 MVar MW 80 MW 0 MVar 10 MW 60 MVar G 100 MW 10 MW 30 MVar 5 Fgure 3.1 Three-generator fve-bus system Consder a fve-bus system as shown n Fgure 3.1. The system data s gven n Table 3.1 Table 3.1 Bus data for Fgure 3.1 Bus number Load MW MVar Gen MW Gen mn MW Gen max MW Voltage setpont Cost ($/MWhr) 1 (slack)

23 Table 3. Lne data for Fgure 3.1 From bus To bus p.u. mpedance MVA ratng Base case power flow(mw) The base case power flow for the system shows (Table 3.) that congeston occurs on lne 1-. The am s to reschedule generaton to remove ths congeston and any other nduced congeston. We frst compute the senstvtes of lne flow P k to changes n generaton P G1, P G, P G4. For that we use the chan rule: P P k G P Pk f = θ θ T 1 f P P G (3.8) where p f represents the power flow equaton at bus, whch s gven as 1 ( θ θ ) ( PG PD ) = 0 (3.9) x In matrx formulaton the power flow equaton s θ = B 1 P, where B s the bus susceptance matrx computed from the lne mpedance data. Fxng bus 1 as the slack, we can then get the equatons for lne flows and the lne flow senstvtes to generaton. The sum of all the products of lne flow senstvtes wth changes n generaton (reschedulng) gves the overload n that partcular lne. 16

24 In ths partcular example, the obectve s to mnmze the reschedulng of generaton requred to lmt the flow on lne 1- to 150 MVA. The OPF problem can then be gven as subect to mn( P + P + P + P + P + P ) (3.10) G1 G1 G G P P + P P + P P = 0 (3.11) G1 G1 G G G4 G4 G4 G4 and P P 1 G + T P1 + T [ P P ] + [ P P ] = G G P G 4 G 4 G 4 (3.1) where 0.47 s the overload on lne 1-. Ths OPF problem can be solved to mnmze the reschedulng of generaton. We get the result that bus 1 must drop ts generaton by 56. MW, bus must rase ts generaton by 5.37 MW, and bus 4 must rase ts generaton by 3.88 MW; G 1 P = 56. MW + G + G 4 P = 5.37 MW P = 3.88 MW (3.13) 3.3 Blateral Dspatch Blateral market structure The conceptual model of a blateral market structure s that gencos and dscos enter nto transacton contracts where the quanttes traded and the prces are at ther own dscreton and not a matter for the ISO;.e., a blateral transacton s made between a genco and a dsco wthout thrd party nterventon. These transactons are then submtted to the ISO. In the absence of any congeston on the system, the ISO smply dspatches all the transactons that are requested, makng an mpartal charge for the servce. 17

25 3.3. Blateral dspatch formulaton In a blateral market mode, the purpose of the optmal transmsson dspatch problem s to mnmze devatons from transacton requests made by the market players. The goal s to make possble all transactons wthout curtalments arsng from operatng constrants. The new set of rescheduled transactons thus obtaned wll be closest to the set of desred transactons, whle smultaneously satsfyng the power flow equatons and operatng constrants. One of the most logcal ways of reschedulng transactons s to do t on the bass of ratonng of transmsson access. Ths may be modeled as a user-pay scheme wth wllngness-to-pay surcharges to avod transmsson curtalment. The mathematcal formulaton of the dspatch problem may then be gven as mn f ( x, u) where f ( u, x) ] o T o T T = [( u u ) A] W [( u u ) A (3.14) subect to g( x, u) = 0 h( x, u) 0 where W s a dagonal matrx wth the surcharges as elements A s a constant matrx reflectng the curtalment strateges of the market partcpants u and u o are the set of control varables, actual and desred x s the set of dependent varables g s the set of equalty constrants, vz., the power flow equatons and the contracted transacton relatonshps, h s the set of system operatng constrants ncludng transmsson capacty lmts The blateral case can be modeled n detal. We consder transactons n the form of ndvdual contracts where a seller nects an amount of power T at one generator bus and the buyer extracts the same amount at a load bus. Let the power system consst of n buses wth the frst m assumed to be seller buses and the remanng n-m as buyer buses. One partcular bus (bus 1) may be desgnated as the slack to take nto account 18

26 transmsson losses. The total power nected/extracted at every bus may be gven by the summaton of all ndvdual transactons carred out at those buses. Thus, for = to m, P = T, and for = m+1 to n, P = (3.15) T The transactons T also appear n the power flow equalty constrants snce they act as the control varables along wth the usual generator bus voltages. The set of control T varables can thus be represented as u = { T, V}, where V s the vector of generator bus voltages. The real and reactve power flow equatons can be wrtten n the usual form represented by g ( x, u) = 0 The transacton curtalment strategy s mplemented by the ISO n collaboraton wth the market partcpants. In the case of blateral dspatch, ths strategy concerns the ndvdual power contracts. One such strategy s such that, n case of an ndvdual contract, the curtalment of the transacted power nected at the genco bus must equal the curtalment of the transacted power extracted at the dsco bus. In ths case, we may rewrte the dspatch formulaton as mn f ( x, u) where f m n 0 ( x, u) = w ( T T = = m+ 1 ) (3.16) where w = the wllngness to pay factor to avod curtalment of transacton 0 T = the desred value of transacton T 19

27 3.3.3 Test results We consder a sx-bus system representng a deregulated market wth blateral transactons. An OPF wll be solved for ths system to determne the optmal generaton schedule that satsfes the obectve of mnmzng devatons from the desred transactons. Table 3.3 provdes the system data pertanng to generaton and load. Table 3.4 provdes the system network data. Fgure 3. shows the system network confguraton. Buses 1 and are genco buses and, beng PV buses, the voltages here are specfed exactly. At the other buses, the allowable upper and lower lmts of voltage are specfed. The losses are assumed to be suppled only by the generator at bus 1. G G Fgure 3. Two-generator sx-bus system Table 3.3 System data Bus Generaton capacty, MW Generator cost characterstc, $/hr Voltage, pu P P +.5P P 00.4P + 5.5P V V V V

28 Table 3.4 System network data From bus to bus Resstance, pu Reactance, pu Lne chargng admttance, pu In ths case, blateral contracts have been consdered between each genco and each dsco. Table 3.5 shows the desred power transactons. Table 3.5 Desred transactons before curtalment Bus # Desred transactons, MW Three strateges for the curtalment of transactons are adopted for congeston management: (1) The curtalment on the dsco loads s assumed to be lnear. In ths case, all the wllngness to pay factors are taken to be equal. () Same as case (1), except that the wllngness to pay prce premum of loads on buses 1 to 3 s assumed to be twce that of loads on buses 4 to 6. 1

29 (3) In ths case, the prce premum of loads on buses 4 to 6 s assumed to be twce that of loads on buses 1 to 3. The OPF problem s solved usng the MINOS-5.0 nonlnear programmng solver n the Generalzed Algebrac Modelng Systems (GAMS) programmng envronment [18]. Table 3.6 shows the constraned generaton and load data obtaned from the OPF soluton. It can be seen that the wllngness to pay and the partcpants curtalment strategy are two factors that sgnfcantly affect the constraned dspatch. The hgher the wllngness to pay, the less s the curtalment of that partcular transacton. The curtalment strateges mplemented have complex effects. These factors not only affect the curtalment of ts own transacton, but wll also mpact that of other transactons. Table 3.6 Constraned generaton and load data after runnng OPF Bus # Constraned generaton and load, MW Case (1) Case () Case (3) Treatment of Transacton-Based Groups In a compettve market scenaro, relatonshps among market players may develop over tme and may lead to the formaton of electrcty supply and consumpton groups. The concept of a group as a collecton of buyers, sellers, and market brokers functonng together n a cohesve manner has to be dealt wth. The formaton of such transactonbased groups n a power system necesstates changes n power dspatch. In the followng sectons we look at dspatch formulatons takng nto account the group concept.

30 3.4.1 Dspatch formulatons Here the concern s to make possble a group transfer wthout curtalment, even f the ndvdual generators wthn the group or utlty have to be rescheduled. The obectve functon s mn f ( x, u) where K m 0 f ( u, x) = [ w ( T T ) ] (3.17) k k = 1 = k m = k where w k = the wllngness to pay factor to avod curtalment of the kth group transacton 0 T k = the desred value of transacton T In ths group curtalment dspatch formulaton, there s the need to develop a strategy to allocate the total group power curtalment among all the group partcpants. That s, f the genco powers wthn a group need to be curtaled, the resultng shortfall has to be allocated to all the group dscos n accordance wth some predetermned strategy. Another way of mplementng curtalment of group transactons s by mnmzng the change to every nected or extracted power transacton at the generator bus and load bus of a group based on the wllngness to pay factors. In ths case, the obectve functon may be expressed as where mn f ( x, u) K m 0 (, ) = [ k ( k k ) ] k= 1 = f u x w T T (3.18) where w = the wllngness to pay factor to avod curtalment of the nected power block T k. k In ths optmal transmsson dspatch problem, all power transactons are requred to be as close as possble to the ntal desred power transfers, and the curtalment decsons are 3

31 based on the market players wllngness to pay to avod curtalment, ther preferred curtalment strateges, and on the system securty condtons. The dspatch procedure starts wth the market partcpants submttng ther multlateral transactons to the ISO. If the operatng and capacty constrants are satsfed whle all the desred transactons are dspatched, there s no need to go through the curtalment routne. Otherwse the optmal dspatch models descrbed above (Sectons 3.., 3.3., 3.4.1) are used to curtal the requested power transfers. Fnally, the orgnal/curtaled power transfers are dspatched and the ISO buys the requred regulatng power at bus 1 to compensate for transmsson losses Test case We now look at an optmal transmsson dspatch problem n a deregulated market havng transacton-based groups. We consder the IEEE 14-bus system here (Fgure 3.3) G G TR TR- 9 6 TR-3 5 G 1 G G Fgure 3.3 IEEE fve-generator fourteen-bus system Some slght modfcatons are made. Bus 4 s renumbered as bus 1 and t s assumed that ths bus s contracted by the system ISO to provde for the transmsson losses;.e., bus 1 4

32 s the system slack bus. Ths bus, n addton to bus 5, s usually shown connected to a synchronous condenser. But n ths problem, we treat bus 1 as a generator bus owned by a genco. Smlarly, bus 5 s treated as a PV-bus n the problem. Table 3.7 provdes the generaton bus data. Table 3.8 provdes the system network data. The voltages at the genco buses are specfed snce they are P-V buses, whereas at the dsco buses, the allowable upper and lower lmts of voltage are specfed. Table 3.7 Generaton bus data Bus Generaton capacty, Generator cost Voltage, pu MW characterstc, $/hr P P P P P P P P +.45P Table 3.8 System network data From bus to bus Resstance, pu Reactance, pu Lne chargng admttance, pu

33 Table 3.8 (cont.) We now assume that there are two groups n ths power system: Group 1 conssts of buses and 3 and makes transfers to dsco buses 7, 9, 11, and 14. Group conssts of the sngle genco bus 4 and makes tranfers to dsco buses 8, 10, 1, and 13. Table 3.9 shows the desred power generaton and load for both groups. Table 3.9 Desred generaton and load before curtalment Bus # Pre-curtalment MW

34 It s seen from the power flow soluton that the dspatch of the contracted transactons wthout any curtalment leads to overloadng of the lnes between buses 3 and 11, and buses 7 and 9. Therefore, to remove ths congeston and to ensure that the system securty lmts are not volated, the ISO needs to curtal the power transactons The followng four strateges for the curtalment of transactons are adopted for congeston management. The results are shown n Table (1) Both groups 1 and employ the group curtalment formulaton as descrbed by (3.17). The curtalment on the dsco loads s assumed to be lnear. The total group power curtalment s taken as a lnear combnaton of the ndvdual dsco curtalments. In ths case, all the wllngness to pay factors are taken to be equal to unty. () Same as case (1), except that the wllngness to pay prce premum of the players n group s assumed to be twce that of the players n group. (3) In ths case, group 1 employs the curtalment strategy gven n (3.17), whereas group adopts the curtalment formulaton descrbed n (3.16). Wllngness to pay premums are mantaned at unty. (4) Same as case (3), except that the wllngness to pay premums on the transactons between buses 4 and 10, and buses 4 and 1, are doubled. Table 3.10 shows the constraned generaton and load data obtaned from the OPF solutons usng the four curtalment strateges. 7

35 Table 3.10 Constraned generaton and load data after runnng OPF Bus # Constraned generaton and load, MW Case (1) Case () Case (3) Case (4) (group #1) (genco) (genco) (group #) 4 (genco) (loss compensator) 1 (genco) The optmal dspatch gves an uncongested system soluton (Table 3.10);.e., all the lne overloads are removed. In case (1), both the groups use the same curtalment strateges wth dentcal wllngness-to-pay factors, and ths results n all power transactons gettng curtaled n varyng degrees. In case (), the wllngness to pay of group 1 s ncreased. Ths does not lead to a proportonate reducton n the curtalment of the transactons n group 1 or a proportonate ncrease n the curtalment of transactons n group. In case (3), the use of two dfferent curtalment strateges for the two groups seems to affect some transactons more than others. For nstance, the transacton between buses 4 and 10, and buses 4 and 1, get relatvely heavly curtaled. Ths s remeded n case (4) where the wllngness to pay for both these pars of players s doubled. 8

36 3.5 Conclusons Ths chapter has focused on the dspatch curtalment problem n a compettve market scenaro. A framework for prce-based operaton under these condtons s explored and an optmal transmsson dspatch methodology s developed. The case studes show the complex nteractons between the market partcpants. 9

37 4 OPTIMAL DISPATCH USING FACTS DEVICES IN DEREGULATED MARKET STRUCTURES 4.1 Introducton In the prevous chapters we have looked at congeston management n deregulated power systems usng models that nclude prcng tools such as prortzaton and curtalment of transactons. In ths chapter we look at treatng congeston management wth the help of flexble AC transmsson (FACTS) devces. We consder an ntegrated approach to ncorporate the power flow control needs of FACTS n the OPF problem for allevatng congeston. Two man types of devces are consdered here, namely, thyrstor controlled seres compensators (TCSC) and thyrstor controlled phase angle regulators (TCPAR). The concept of flexble AC transmsson systems (FACTS) was frst proposed by Hngoran [19]. FACTS devces have the ablty to allow power systems to operate n a more flexble, secure, economc, and sophstcated way. Generaton patterns that lead to heavy lne flows result n hgher losses, and weakened securty and stablty. Such patterns are economcally undesrable. Further, transmsson constrants make certan combnatons of generaton and demand unvable due to the potental of outages. In such stuatons, FACTS devces may be used to mprove system performance by controllng the power flows n the grd. Studes on FACTS so far have manly focused on devce developments and ther mpacts on the power system aspects such as control, transent and small sgnal stablty enhancement, and dampng of oscllatons [0]-[3]. Here we look at solvng the OPF problem n a power system ncorporatng FACTS devces. As we have seen n the earler chapters, dfferent soluton approaches are possble to solve the OPF problem. The man conventonal control varables are the generaton MWs when the DC power flow model s used. Wth the ncreased presence of ndependent gencos n the deregulated scenaro, the operaton of power systems would requre more sophstcated means of power control. FACTS devces can meet that need. 30

38 4. Statc Modelng of FACTS Devces For the optmal power dspatch formulaton usng FACTS controllers, only the statc models of these controllers have been consdered here [4]. It s assumed that the tme constants n FACTS devces are very small and hence ths approxmaton s ustfed Thyrstor-controlled seres compensator (TCSC) Thyrstor-controlled seres compensators (TCSC) are connected n seres wth the lnes. The effect of a TCSC on the network can be seen as a controllable reactance nserted n the related transmsson lne that compensates for the nductve reactance of the lne. Ths reduces the transfer reactance between the buses to whch the lne s connected. Ths leads to an ncrease n the maxmum power that can be transferred on that lne n addton to a reducton n the effectve reactve power losses. The seres capactors also contrbute to an mprovement n the voltage profles. Fgure 4.1 shows a model of a transmsson lne wth a TCSC connected between buses and. The transmsson lne s represented by ts lumped π-equvalent parameters connected between the two buses. Durng the steady state, the TCSC can be consdered as a statc reactance -x c. Ths controllable reactance, x c, s drectly used as the control varable to be mplemented n the power flow equaton. Bus S R +X S Bus -x c B c B c Fgure 4.1 Model of a TCSC Let the complex voltages at bus and bus be denoted as V δ and V δ, respectvely. The complex power flowng from bus to bus can be expressed as S * = P Q = V * * = V [( V V ) Y + V ( B I c )] 31

39 * = V [ G + ( B + B )] V V ( G + B ) (4.1) c where G + B = ( R + X X ) (4.) 1 L L C Equatng the real and magnary parts of the above equatons, the expressons for real and reactve power flows can be wrtten as P = V G V V G cos( δ δ ) V V B sn( δ δ ) (4.3) Q = V ( B + B ) V V G sn( δ δ ) + V V B cos( δ δ ) (4.4) c Smlarly, the real and reactve power flows from bus to bus can be expressed as P = V G V V G cos( δ δ ) + V V B sn( δ δ ) (4.5) Q = V ( B + B ) + V V G sn( δ δ ) + V V B cos( δ δ ) (4.6) c The actve and reactve power loss n the lne can be calculated as P = P + P L = V G + V G V V G cos( δ δ ) (4.7) L Q = Q + Q = V ( B + B ) V ( B + B ) + V V B cos( δ δ ) (4.8) c These equatons are used to model the TCSC n the OPF formulatons. c 4.. Thyrstor-controlled phase angle regulator (TCPAR) In a thyrstor-controlled phase angle regulator, the phase shft s acheved by ntroducng a varable voltage component n perpendcular to the phase voltage of the lne. The statc model of a TCPAR havng a complex tap rato of 1:a α and a transmsson lne between bus and bus s shown n Fgure 4.. Bus S 1:a α R +X Fgure 4. Model of TCPAR S Bus 3

40 The real and reactve power flows from bus to bus can be expressed as and P V a V av Y * * = Re{ [( ) ]} = a V G avv G cos( δ δ + α) avv B sn( δ δ + α) (4.9) Q V a V av Y * * = Im{ [( ) ]} = a V G avv B cos( δ δ + α) avv G sn( δ δ + α) (4.10) Smlarly, real and reactve power flows from bus to bus can be wrtten as and P V V av Y * = Re{ [( ) ]} = V G avv G cos( δ δ + α) + avv B sn( δ δ + α) (4.11) Q V V av Y * = Im{ [( ) ]} = V B + avv B cos( δ δ + α) + avv G sn( δ δ + α) (4.1) The real and reactve power loss n the lne havng a TCPAR can be expressed as Pl = P + P = av G + V G VVG cos( δ δ + α) (4.13) Ql = Q + Q = av B V B + VVB cos( δ δ + α) (4.14) Ths mathematcal model makes the Y-bus asymmetrcal. In order to make the Y-bus symmetrcal, the TCPAR can be smulated by augmentng the exstng lne wth addtonal power nectons at the two buses. The nected actve and reactve powers at bus ( P, Q ) and bus ( P, Q ) are gven as P = a V G av V [ G sn( δ δ ) B cos( δ δ )] (4.15) P = av V G sn( δ δ ) + B cos( δ δ )] (4.16) [ Q = a V B + av V [ G cos( δ δ ) + B sn( δ δ )] (4.17) Q = av V G cos( δ δ ) B sn( δ δ )] (4.18) [ These equatons wll be used to model the TCPAR n the OPF formulaton. 33

Proceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3,

Proceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, roceedngs of the 0th WSEAS Internatonal Confenrence on ALIED MATHEMATICS, Dallas, Texas, USA, November -3, 2006 365 Impact of Statc Load Modelng on Industral Load Nodal rces G. REZA YOUSEFI M. MOHSEN EDRAM

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

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

ELE B7 Power Systems Engineering. Power Flow- Introduction

ELE B7 Power Systems Engineering. Power Flow- Introduction ELE B7 Power Systems Engneerng Power Flow- Introducton Introducton to Load Flow Analyss The power flow s the backbone of the power system operaton, analyss and desgn. It s necessary for plannng, operaton,

More information

Lecture 10 Support Vector Machines II

Lecture 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 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

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

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

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

MMA and GCMMA two methods for nonlinear optimization

MMA 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 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

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

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

V.G.Umalem 1, S.B.Warkad 2 1 Department of Electrical Engineering Priyadarshini College of Engineering Nagpur, Maharashtra, India ABSTRACT

V.G.Umalem 1, S.B.Warkad 2 1 Department of Electrical Engineering Priyadarshini College of Engineering Nagpur, Maharashtra, India ABSTRACT 2017 IJSRSET Volume 3 Issue 8 Prnt ISSN: 2395-1990 Onlne ISSN : 2394-4099 Themed Secton : Engneerng and Technology Comparson of Locatonal Margnal Transmsson Prcng V.G.Umalem 1, S.B.Warkad 2 1 Department

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

A SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI]

A SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI] Yugoslav Journal of Operatons Research (00) umber 57-66 A SEPARABLE APPROXIMATIO DYAMIC PROGRAMMIG ALGORITHM FOR ECOOMIC DISPATCH WITH TRASMISSIO LOSSES Perre HASE enad MLADEOVI] GERAD and Ecole des Hautes

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

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

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

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

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

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

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

Perfect Competition and the Nash Bargaining Solution

Perfect 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 information

An Admission Control Algorithm in Cloud Computing Systems

An Admission Control Algorithm in Cloud Computing Systems An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence

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

Some modelling aspects for the Matlab implementation of MMA

Some 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 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

Operating conditions of a mine fan under conditions of variable resistance

Operating conditions of a mine fan under conditions of variable resistance Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 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 information

Determining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application

Determining Transmission Losses Penalty Factor Using Adaptive Neuro Fuzzy Inference System (ANFIS) For Economic Dispatch Application 7 Determnng Transmsson Losses Penalty Factor Usng Adaptve Neuro Fuzzy Inference System (ANFIS) For Economc Dspatch Applcaton Rony Seto Wbowo Maurdh Hery Purnomo Dod Prastanto Electrcal Engneerng Department,

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

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

Transfer Capability Computations in Deregulated Power Systems

Transfer Capability Computations in Deregulated Power Systems Proceedngs of the rd Hawa Internatonal Conference on System Scences - 000 ransfer Capablty Computatons n Deregulated Power Systems Mohamed Shaaban (St. M. IEEE Yxn N (S. M. IEEE Felx F. Wu ( Fellow, IEEE

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

An Interactive Optimisation Tool for Allocation Problems

An Interactive Optimisation Tool for Allocation Problems An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents

More information

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

Physics 5153 Classical Mechanics. Principle of Virtual Work-1 P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal

More information

The Study of Teaching-learning-based Optimization Algorithm

The Study of Teaching-learning-based Optimization Algorithm Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute

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

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer 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 information

Economic pricing techniques for transmission network in deregulated electricity market

Economic pricing techniques for transmission network in deregulated electricity market Economc prcng technques for transmsson network n deregulated electrcty market Shakashraf al 1, K.Vmala kumar 2 P.G.Scholor, E.E.E Department, J.N.T.U.A College of Engneerng,Pulvendula,Kadappa,Inda 1 Assstant

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

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

Supporting Information for: Two Monetary Models with Alternating Markets

Supporting 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 information

E O C NO N MIC C D I D SP S A P T A C T H C H A N A D N D UN U I N T T CO C MMITM T EN E T

E O C NO N MIC C D I D SP S A P T A C T H C H A N A D N D UN U I N T T CO C MMITM T EN E T Chapter 4 ECOOMIC DISPATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

More information

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton

More information

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL

More information

AGC Introduction

AGC Introduction . Introducton AGC 3 The prmary controller response to a load/generaton mbalance results n generaton adjustment so as to mantan load/generaton balance. However, due to droop, t also results n a non-zero

More information

Foresighted Demand Side Management

Foresighted 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 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

Supporting Materials for: Two Monetary Models with Alternating Markets

Supporting Materials for: Two Monetary Models with Alternating Markets Supportng Materals for: Two Monetary Models wth Alternatng Markets Gabrele Camera Chapman Unversty Unversty of Basel YL Chen Federal Reserve Bank of St. Lous 1 Optmal choces n the CIA model On date t,

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

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu

More information

Hila Etzion. Min-Seok Pang

Hila 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 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

Term Project - select journal paper and outline. Completed analysis due end

Term Project - select journal paper and outline. Completed analysis due end EE 5200 - Lecture 30 Fr ov 4, 2016 Topcs for Today: Announcements Term Project - select journal paper and outlne. Completed analyss due end of Week 12. Submt va e-mal as mn-lecture.ppt wth voce narraton.

More information

A New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems

A New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence

More information

Advanced Circuits Topics - Part 1 by Dr. Colton (Fall 2017)

Advanced Circuits Topics - Part 1 by Dr. Colton (Fall 2017) Advanced rcuts Topcs - Part by Dr. olton (Fall 07) Part : Some thngs you should already know from Physcs 0 and 45 These are all thngs that you should have learned n Physcs 0 and/or 45. Ths secton s organzed

More information

Which Separator? Spring 1

Which Separator? Spring 1 Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal

More information

Optimal Allocation of FACTS Devices to Enhance Total Transfer Capability Based on World Cup Optimization Algorithm

Optimal Allocation of FACTS Devices to Enhance Total Transfer Capability Based on World Cup Optimization Algorithm World Essays Journal / 5 (): 40-45 07 07 Avalable onlne at www. worldessaysj.com Optmal Allocaton of FACS Devces to Enhance otal ransfer Capablty Based on World Cup Optmzaton Algorthm Farzn mohammad bolbanabad

More information

Second Order Analysis

Second Order Analysis Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

Optimal Dispatch in Electricity Markets

Optimal Dispatch in Electricity Markets QUANTITATIVE FINANCE RESEARCH CENTRE QUANTITATIVE FINANCE RESEARCH CENTRE Research Paper 06 October 007 Optmal Dspatch n Electrcty Markets Vladmr Kazakov and Anatoly M Tsrln ISSN 1441-8010 www.qfrc.uts.edu.au

More information

Credit Card Pricing and Impact of Adverse Selection

Credit 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 information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Pricing and Resource Allocation Game Theoretic Models

Pricing 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 information

Finite Element Modelling of truss/cable structures

Finite Element Modelling of truss/cable structures Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures

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

3.2. Cournot Model Cournot Model

3.2. Cournot Model Cournot Model Matlde Machado Assumptons: All frms produce an homogenous product The market prce s therefore the result of the total supply (same prce for all frms) Frms decde smultaneously how much to produce Quantty

More information

1 Convex Optimization

1 Convex Optimization Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,

More information

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 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 information

Temperature. Chapter Heat Engine

Temperature. 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 information

Experience with Automatic Generation Control (AGC) Dynamic Simulation in PSS E

Experience 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 information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.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 information

Fundamental loop-current method using virtual voltage sources technique for special cases

Fundamental loop-current method using virtual voltage sources technique for special cases Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,

More information

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan

More information

Computing Correlated Equilibria in Multi-Player Games

Computing Correlated Equilibria in Multi-Player Games Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,

More information

Statistical Circuit Optimization Considering Device and Interconnect Process Variations

Statistical Circuit Optimization Considering Device and Interconnect Process Variations Statstcal Crcut Optmzaton Consderng Devce and Interconnect Process Varatons I-Jye Ln, Tsu-Yee Lng, and Yao-Wen Chang The Electronc Desgn Automaton Laboratory Department of Electrcal Engneerng Natonal Tawan

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

Numerical Heat and Mass Transfer

Numerical 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 information

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence

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

THE VIBRATIONS OF MOLECULES II THE CARBON DIOXIDE MOLECULE Student Instructions

THE VIBRATIONS OF MOLECULES II THE CARBON DIOXIDE MOLECULE Student Instructions THE VIBRATIONS OF MOLECULES II THE CARBON DIOXIDE MOLECULE Student Instructons by George Hardgrove Chemstry Department St. Olaf College Northfeld, MN 55057 hardgrov@lars.acc.stolaf.edu Copyrght George

More information

Comparative Analysis of SPSO and PSO to Optimal Power Flow Solutions

Comparative Analysis of SPSO and PSO to Optimal Power Flow Solutions Internatonal Journal for Research n Appled Scence & Engneerng Technology (IJRASET) Volume 6 Issue I, January 018- Avalable at www.jraset.com Comparatve Analyss of SPSO and PSO to Optmal Power Flow Solutons

More information

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys

More information

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Improvement of Power System Condition by Placement of Flexible Alternating Current Transmission Systems devices

Improvement of Power System Condition by Placement of Flexible Alternating Current Transmission Systems devices Improvement of ower System Condton by lacement of Flexble Alternatng Current Transmsson Systems devces Mehd afar Department of Electrcal Engneerng, Marvdasht Branch, Islamc Azad Unversty, Marvdasht, Iran

More information

Lecture Notes, January 11, 2010

Lecture Notes, January 11, 2010 Economcs 200B UCSD Wnter 2010 Lecture otes, January 11, 2010 Partal equlbrum comparatve statcs Partal equlbrum: Market for one good only wth supply and demand as a functon of prce. Prce s defned as the

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?

Welfare 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 information

A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegian Business School 2011

A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegian Business School 2011 A NOTE ON CES FUNCTIONS Drago Bergholt, BI Norwegan Busness School 2011 Functons featurng constant elastcty of substtuton CES are wdely used n appled economcs and fnance. In ths note, I do two thngs. Frst,

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

University of California, Davis Date: June 22, 2009 Department of Agricultural and Resource Economics. PRELIMINARY EXAMINATION FOR THE Ph.D.

University 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 information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased

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

1 The Sidrauski model

1 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 information