A SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI]
|
|
- Lee Robinson
- 5 years ago
- Views:
Transcription
1 Yugoslav Journal of Operatons Research (00) umber A SEPARABLE APPROXIMATIO DYAMIC PROGRAMMIG ALGORITHM FOR ECOOMIC DISPATCH WITH TRASMISSIO LOSSES Perre HASE enad MLADEOVI] GERAD and Ecole des Hautes Etudes Commercales Montr al (Qu bec) Canada Abstract: The standard way to solve the statc economc dspatch problem wth transmsson losses s the penalty factor method. The problem s solved teratvely by a Lagrange multpler method or by dynamc programmng usng values obtaned at one teraton to compute penalty factors for the next untl stablty s attaned. A new teratve method s proposed for the case where transmsson losses are represented by a quadratc formula (.e. by the tradtonal B-coeffcents). A separable approxmaton s made at each teraton whch s much closer to the ntal problem than the penalty factor approxmaton. Consequently lower cost solutons may be obtaned n some cases and convergence s faster. Keywords: Economc dspatch transmsson losses B-coeffcents penalty factors separable approxmaton dynamc programmng.. ITRODUCTIO Due to the enormous costs nvolved optmzng the use of equpment for power generaton and transmsson s a lastng concern. Gven several thermal or hydro unts often wth dfferent characterstcs one must decde how to dstrbute the load consdered between them. Ths problem called economc dspatch has been much studed both n the statc and dynamc cases. It s dscussed at length n the book of Wood and Wollenberg [6] Power generaton operaton and control an enlarged second edton of whch has recently appeared. The standard way to solve the statc case wth transmsson losses s the penalty factor method. The problem s solved teratvely by a Lagrangan multpler method or by dynamc programmng usng values obtaned at one teraton to compute penalty factors for the next untl stablty s attaned.
2 58 P. Hansen. Mladenov} / A Separable Approxmaton Dynamc Programmng Algorthm The purpose of ths paper s to propose a new teratve method for the case where transmsson losses are represented by a quadratc formula (.e. by the tradtonal B-coeffcents). A separable approxmaton s made at each teraton whch s much closer to the ntal problem than the penalty factor approxmaton. Moreover the problem consdered at each teraton can be solved by dynamc programmng. Convergence s faster than n the scheme of to Lang and Glover [4] whch also uses dynamc programmng. The paper s organzed as follows: a mathematcal formulaton of the problem s gven n the next secton. Prevous soluton methods are revewed n Secton 3. The partcular case of a separable loss functon s studed n Secton 4 and llustrated by an example of Wood and Wollenberg [6]. The new method s descrbed n full n Secton 5 and appled to examples from [6] and [4]. Conclusons are drawn n Secton 6.. FORMULATIO Consder thermal unts commtted to serve a load of P R at mnmum cost. Assume that producton of each unt s bounded below and above. Assume further that transmsson losses n the network are ncurred and can be represented by a quadratc formula (wth the so-called B-coeffcents). Ths problem can be stated mathematcally as mnmze FT = F( P ) = () subject to and P = PR + P L () = Pmn P Pmax =... (3) where P s the output of unt (n MW) F( P) s the nput of unt or ts cost rate (n $/h ) P R s the requred load (n MW) P L s the transmsson losses (n MW). Moreover PL = PB jpj + B0P0 + B 00. (4) = j= = Dervaton of ths formula for losses s explaned n [6]. eglectng transmsson losses.e. settng P L = 0 n () problem () - (3) can be solved by a Lagrange multpler method [6] or by dynamc programmng [ 4 6].
3 P. Hansen. Mladenov} / A Separable Approxmaton Dynamc Programmng Algorthm PREVIOUS SOLUTIO METHODS When transmsson losses are consdered the standard soluton method s the penalty factor approach. Consder the Lagrange functon wth a multpler λ for (): mnmze L = F( P) + λ( PR + PL P). (5) = = eglectng bounds on the where P the frst order condtons are equaton () above and df = λ =... (6) L L = B P + B0 j= j j (7) are the ncremental losses and = L are the penalty factors coordnaton equatons. If bounds on the BjPj B0 j= = PF (8) PF for unts =.... Equatons () and (6) are called P are taken nto account the frst order condtons become λ f P = Pmn df PF = λ f P ( Pmn P max) λ f P = Pmax. (9) An teratve method to solve ()-(3) s the followng [6]:. Solve the coordnaton equatons wth unt penalty factors (.e. neglectng losses) to get an ntal soluton P P... P. Set the teraton counter k =.. Compute penalty factors wth values of the last teraton.e. PF ( k) = =... n B P j= j ( k ) j B 3. Solve the coordnaton equatons to get a soluton 0 ( k) ( k) ( k)... P P P. (Ths can be done n varous ways e.g. a search technque for the optmal λ a ewton-raphson search etc see [6]).
4 60 P. Hansen. Mladenov} / A Separable Approxmaton Dynamc Programmng Algorthm 4. Compute the current dfference between the producton and load plus losses.e. ( k) ( k) ( k) ( k) P PR P BjPj B0P B 00 = = j= = δ = If δ ε (a gven tolerance) stop. Otherwse ncrease k by and return to step. Whle no formal proof of convergence for ths method seems to have been publshed and values of δ may oscllate a local and possbly global optmum s usually reached n a farly small number of teratons. Modfcaton to the teratve method just descrbed to allow soluton by dynamc programmng are proposed n [4]. In Step the ntal soluton s found by the recurson where * * F ( D ) = mn{ F ( ) + ( )} D P R P F P (0) R s the set of ntegers n [ P P mn max] the range of producton for unt assumng that approxmaton to MW and D s chosen among the range of possble productons for the frst unts.e. t s nteger and kmn kmax k= k= P D P. () k In Step 3 each cost functon F s multpled by the penalty factor P the load P R s augmented by the losses as estmated and the problem s agan solved by the dynamc programmng recurson (0). The Lagrange functon for ths step s F( P) = ( k ) BjPj B0 j= ( k ) ( k ) ( k ) + λ P R P BjPj B0 P B00 P = j= = = () and the frst order condton as the losses are fxed = λ f P = P BjP B f P = P j= mn df = λ f P ( Pmn Pmax ( k ) j 0 λ max. and are the same as (9) except that the values of ) (3) P are fxed n the penalty factors.
5 P. Hansen. Mladenov} / A Separable Approxmaton Dynamc Programmng Algorthm 6 4. SEPARABLE LOSSES Economc dspatch wth transmsson losses can be optmzed by dynamc programmng wthout usng penalty factors. The easest case s when losses are separable n the P. Assume also that they are quadratc a partcular case consdered n [6]. Then the power load and the losses. Thus P produced by unt wll be equal to the power P gong to the P = P b0 bp bp (4) where b b and are the known coeffcents of the loss functon. Hence 0 b b ( b) 4b( P + b P = 0 ). (5) b One can assocate to P a cost functon F ( P ) equal to the cost necessary for unt to contrbute P to the load.e. F( P) where P s obtaned from P by (4). The correspondence between F and F s llustrated on Fgure. Fgure : Input-Output functons F( P ) and F( P ) The range of values of P deduced from that of values or n other words an approxmaton of MW: P s assumng nteger Pmn = [ Pmn b0 bpmn bpmn ] P [ Pmax b0 bpmax bpmax ] = P max (6)
6 6 P. Hansen. Mladenov} / A Separable Approxmaton Dynamc Programmng Algorthm where a and a are respectvely the smallest nteger not smaller than and the largest nteger not larger than a ( P mn and P max are assumed to be nteger as well). The dynamc programmng recurson s * * F ( D ) = mn{ F ( ) + ( )} D P R P F P (7) R = [ P P ] the range of effectve producton of unt (.e. that whch s where mn max not lost) and D Pk mn P k max (8) k= k= the range of demand whch can be satsfed by the frst unts. Ths recurson s used * * to fnd the optmal polcy... * P P P from whch the powers P * P *... P * to be produced by each unt are obtaned by (5). The cost of ths polcy s * * F ( PR) = ( = F P ). Observe that the method proposed gves a globally optmal soluton (up to the approxmatons n the values of the P ) even f the cost functons F( P) and/or P are non-convex. In contrast the classcal penalty functon method may stop at a local optmum n ths case. Example. (Wood and Wollenberg [6] p 36). Ths problem nvolves three unts wth nput/output functons and producton ranges: PR F ( P ) = P P P = 50 MW P = 600 MW mn max F ( P ) = P P P = 00 MW P = 400 MW mn max F ( P ) = P P P = 50 MW P = 00 MW 3mn max = 850 MW and losses are gven by PL = P P P 3. Soluton. The followng soluton s obtaned by applyng dynamc programmng to the transformed problem: P = P = P = wth losses equal to ote that the same losses are obtaned by the penalty factor approach n 4 teratons ([6]).
7 P. Hansen. Mladenov} / A Separable Approxmaton Dynamc Programmng Algorthm SEPARABLE QUADRATIC APPROXIMATIO An teratve method usng a separable quadratc approxmaton of the loss functon s easly obtaned by fxng at each teraton one value P n each quadratc term nvolvng two such values P and P j. Such an approxmaton s much more precse than the one obtaned by fxng both values n all such terms dscussed above. Then the algorthm of the prevous secton s as follows: (a) Obtan an ntal soluton P ( 0) P ( 0)... P ( 0) deletng all quadratc terms P B P wth j j j by solvng the problem after j n the loss functon (or whch s better by some heurstcs see below). Set the teraton counter k =. (b) Compute the followng separable quadratc approxmaton of the loss functon ( ) + k BP PB jpj + B0 P + B 00 (9) = = j= = j (c) Solve the problem wth the approxmate loss functon (9) to obtan a soluton ( k) ( k) ( k)... P P P (for ths purpose use DP explaned n the prevous secton). (d) Compute the approxmate and exact losses usng ( k) ( k) ( k)... P P P n (9) and (4). If these values dffer n absolute value by less than ε stop. Otherwse ncrease k by and return to (b). A better ntal approxmaton to the loss functon may be obtaned by computng a feasble ntal soluton by heurstcs such as followng: (h) Set P = P for =... ; mn PR P (h) Compute δ = = P ; (h3) If P + δ P > P for some set max reduce by. Return to (h); (h4) Set P δ P for all remanng. + P = P delete that ndex value and max The am of ths heurstcs s to obtan quckly a feasble soluton n whch the productons above the mnmum ones of the varous unts are as close as possble. Therefore t frst attempts to gve an equal load to each unt. If some upper bound s not satsfed the largest possble load s assgned to the correspondng unt. The procedure s terated wth the total unassgned load. More sophstcated heurstcs could take cost functons nto account but ths does not appear to be necessary. Example. (Wood and Wollenberg [6] p 7-0)). The fuel cost curves for the three unts n the sx-bus network consdered are gven by
8 64 P. Hansen. Mladenov} / A Separable Approxmaton Dynamc Programmng Algorthm F ( P ) = P P F ( P ) = P P F ( P ) = P P wth a total load to be suppled P R = 0 and unt dspatch lmts P P P3 80. The coeffcents B00 = B0 = ( ) ( = 3) and the B matrx s B = Soluton. The optmal soluton s obtaned n 3 teratons: It. F P P P 3 PR + P L Error Example 3. (Lang and Glover [4]). The operatng costs of the generators are represented by the followng polynomals of thrd order: 3 a0 + ap + ap + a3p = 3 where coeffcents as well as P mn and P max are lsted below: Unt a 0 a a a 3 P mn P max The load s P R = 400 and the losses are gven by The B -matrx s PL = P P P B =
9 P. Hansen. Mladenov} / A Separable Approxmaton Dynamc Programmng Algorthm 65 Soluton. If an ntal soluton s obtaned by neglectng the off-dagonal elements of matrx B the optmal soluton s obtaned n four teratons: It. F P P P 3 PR + P L Error Another way to derve an ntal soluton s also developed above n Secton 5. In ths example the ntal soluton obtaned s P = P = ; P 3 = The optmal soluton s then reached n only two teratons: It. F P P P 3 PR + P L Error Example 4. In the prevous examples convex programmng problems are solved snce both the objectve functon F and the transmsson losses P are convex. ote that T convexty of the P L functon follows from the postve defnteness of the B matrx (.e. the man mnors of B are postve n Examples and 3 above). In ths example we change elements b and b from Example 3.e. we now have b = b = Then the mnor of the second order s negatve (det = < 0) and thus there are more than one local mnma. Snce the penalty factor method s derved from the frst order condtons t s a local optmzaton method and may not reach the global optmum. Soluton. Wth our separable approxmaton dynamc programmng method the followng locally optmal soluton s obtaned n sx teratons: It. F P P P 3 PR + P L Error We then ran the penalty factor method to see what soluton t gves for ths non-convex example. For that purpose we used software attached to the book [6]. The soluton obtaned s as follows: FP ( P P 3) = ; P = P = P 3 = λ = Therefore the objectve functon value and the total losses are and 8.6 respectvely (compare those values wth and 56.8 obtaned by our approach). L
10 66 P. Hansen. Mladenov} / A Separable Approxmaton Dynamc Programmng Algorthm We also tred a modfcaton of the penalty factor method: nstead of adjustng λ n the nner loop (as suggested n [6] for Step 3 n the algorthm gven n Secton 3) we smply fnd the closest soluton that satsfes the range constrants (3) as well. In other words wthn Step 3 we teratvely project the current soluton ( P... P n) onto the hyperplane defned by () and the hypercube (3) untl a feasble soluton s reached. ote that both methods are equvalent f the pont obtaned after solvng the coordnaton equatons s feasble. The result obtaned n 5 teratons s: F( ) = Agan ths soluton s worse than the dynamc programmng one. 6. COCLUSIO A new method for statc termal power unts economc dspatch problem wth transmsson losses s proposed. It uses a separable quadratc approxmaton to the loss functon and refnes t teratvely. Convergence s qucker than wth prevous methods. Moreover t may lend to better locally optmal solutons than those methods n case of non-convexty of the loss functon. REFERECES [] Bellman R.E. and Dreyfus S.E. Appled Dynamc Programmng Prnceton Unversty Press Prnceton 96. [] Chowdury B.H. and Rahman S. "A revew of recent advances n economc dspatch'' IEEE Trans. PWRS 5 (V) (990) [3] Krchmayer L.L. and Stagg G.W. "Evaluaton of methods of coordnatng nternal fuel and ncremental transmsson losses'' AIEE Trans. 7 (III) (95) [4] Lang Z.-X. and Glover J.D. "A zoom feature for a dynamc programmng soluton to economc dspatch'' IEEE Trans. PWRS 7 (II) [5] Rnglee R.J. and Wllams D.D. "Economc dspatch operaton consderng valve throttng losses II - Dstrbuton of system loads by method of dynamc programmng'' IEEE Trans. PAS 8 (I) (963) [6] Wood A.J. and Wollenberg B.F. Power Generaton Operaton and Control Wley ew York 984. nd revsed edton 996.
Chapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
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 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 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 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 informationE 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 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 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 informationChapter - 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 informationCHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD
90 CHAPTER 7 STOCHASTIC ECOOMIC EMISSIO DISPATCH-MODELED USIG WEIGHTIG METHOD 7.1 ITRODUCTIO early 70% of electrc power produced n the world s by means of thermal plants. Thermal power statons are the
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 informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
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 informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationOn 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 informationWinter 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 informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationYong 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 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 informationExercises of Chapter 2
Exercses of Chapter Chuang-Cheh Ln Department of Computer Scence and Informaton Engneerng, Natonal Chung Cheng Unversty, Mng-Hsung, Chay 61, Tawan. Exercse.6. Suppose that we ndependently roll two standard
More informationDetermining 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 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 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 informationCOS 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 informationTopic 5: Non-Linear Regression
Topc 5: Non-Lnear Regresson The models we ve worked wth so far have been lnear n the parameters. They ve been of the form: y = Xβ + ε Many models based on economc theory are actually non-lnear n the parameters.
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 informationLagrange Multipliers Kernel Trick
Lagrange Multplers Kernel Trck Ncholas Ruozz Unversty of Texas at Dallas Based roughly on the sldes of Davd Sontag General Optmzaton A mathematcal detour, we ll come back to SVMs soon! subject to: f x
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 informationFIRST AND SECOND ORDER NECESSARY OPTIMALITY CONDITIONS FOR DISCRETE OPTIMAL CONTROL PROBLEMS
Yugoslav Journal of Operatons Research 6 (6), umber, 53-6 FIRST D SECOD ORDER ECESSRY OPTIMLITY CODITIOS FOR DISCRETE OPTIML COTROL PROBLEMS Boban MRIKOVIĆ Faculty of Mnng and Geology, Unversty of Belgrade
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 informationChapter 12. Ordinary Differential Equation Boundary Value (BV) Problems
Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(
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 information1 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 informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
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 informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
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 informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
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 informationModule 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 informationSolutions 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 informationSuggested solutions for the exam in SF2863 Systems Engineering. June 12,
Suggested solutons for the exam n SF2863 Systems Engneerng. June 12, 2012 14.00 19.00 Examner: Per Enqvst, phone: 790 62 98 1. We can thnk of the farm as a Jackson network. The strawberry feld s modelled
More informationDifference 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 informationCSci 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 informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
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 informationInteractive 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 informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationSingle-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 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 informationLecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES
COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve
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 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 informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationAnnexes. 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 informationNUMERICAL 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 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 informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
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 informationCHAPTER 17 Amortized Analysis
CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average
More informationAn 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 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 informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
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 informationLecture 2: Prelude to the big shrink
Lecture 2: Prelude to the bg shrnk Last tme A slght detour wth vsualzaton tools (hey, t was the frst day... why not start out wth somethng pretty to look at?) Then, we consdered a smple 120a-style regresson
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
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 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 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 informationComputing 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 informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
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 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 informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationEconomic Dispatch Scheduling using Classical and Newton Raphson Method
wwwjemrnet ISS (OIE): 00, ISS (RIT): 99 Volume, Issue, June0 Internatonal Journal of Enneerng and Management Research age umber: Economc Dspatch Schedulng usng Classcal and ewton Raphson Method avneet
More informationELE 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 informationOptimal 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 informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationCombined Economic Emission Dispatch Solution using Simulated Annealing Algorithm
IOSR Journal of Electrcal and Electroncs Engneerng (IOSR-JEEE) e-iss: 78-1676,p-ISS: 30-3331, Volume 11, Issue 5 Ver. II (Sep - Oct 016), PP 141-148 www.osrjournals.org Combned Economc Emsson Dspatch Soluton
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationLINEAR 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 informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationThe 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 informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationCHAPTER 7 CONSTRAINED OPTIMIZATION 2: SQP AND GRG
Chapter 7: Constraned Optmzaton CHAPER 7 CONSRAINED OPIMIZAION : SQP AND GRG Introducton In the prevous chapter we eamned the necessary and suffcent condtons for a constraned optmum. We dd not, however,
More informationPower Allocation/Beamforming for DF MIMO Two-Way Relaying: Relay and Network Optimization
Power Allocaton/Beamformng for DF MIMO Two-Way Relayng: Relay and Network Optmzaton Je Gao, Janshu Zhang, Sergy A. Vorobyov, Ha Jang, and Martn Haardt Dept. of Electrcal & Computer Engneerng, Unversty
More informationAmiri 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 informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More information