A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse


 Shawn Bailey
 2 years ago
 Views:
Transcription
1 A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse Bernie Lesieutre Dan Molzahn University of WisconsinMadison PSERC Webinar, October 15, 2013
2 Voltage Stability Static:  Loading, Power Flows  Local Reactive Power Support Dynamic:  Component Controls  Network Controls 2
3 OVERVIEW: Static Voltage Stability Margin Voltage, V Margin Power A common voltage stability margin measures the distance from a postcontingency operating point to the nose point on a powervoltage curve. 3
4 OVERVIEW: Static Voltage Stability Margin Voltage, V Margin (negative) Power It s even possible that a normal power flow solution won t exist, post contingency. 4
5 ISSUES Voltage, V Margin Power 1. We don t know the values on the curve. 2. We don t know whether a postcontingency operating point exists! 5
6 Typical Approach Run postcontingency power flow. This may or may not converge. If successful, determine nose point: use a sequence of power flows with increasing load, or a continuation power flow. 6
7 Our Approach Cast as an optimization problem: Minimize the controlled voltages while a solution exists. (Claim: a solution exists.) Exploit the quadratic nature of the power flow equations to directly obtain Traditional Voltage Stability Margin even when the margin is negative. 7
8 Advantages Eliminates need for repeated solutions (multiple power flows, continuation power flows) Often offers provably globally optimal results Works when the margin is negative, i.e. when there isn t a solution. 8
9 OVERVIEW: Static Voltage Stability Margin Voltage, V Margin V 0 V opt P 0 Optimal Solution P max Power 9
10 Power Flow Equations: Review (I D1 +ji Q1 ) (V D1 +jv Q1 ) Electrical Network I = YV Y = G+jB (V DN +jv QN ) (I DN +ji QN ) Current Injection equations in Rectangular Coordinates: 10
11 Power Flow Equations: Review (P 1 +jq 1 ) (V D1 +jv Q1 ) Electrical Network I = YV Y = G+jB (V DN +jv QN ) (P N +jq N ) Power Injection equations in Rectangular Coordinates: 11
12 Power Flow Equations The power flow equations are quadratic in voltage variables: For reference, power engineers almost always express these equations in voltage polar coordinates: 12
13 Classical Power Flow Constraints Bus Type Specified Calculated PQ (load) P, Q V, δ PV (generator) P, V Q, δ Slack V, δ = 0º P, Q The controlled voltages are the problemspecified slack and generator voltage magnitudes. Locking the controlled voltages in constant proportion, and allowing them to scale by α, we claim a power solution exists for any power flow injection profile. (subject to the unimportant small print.) 13
14 Optimization Problem Modify the power flow formulation to Slack bus voltage magnitude unconstrained PV bus voltage magnitudes scale with slack bus voltage Minimize slack bus voltage 14
15 Optimization Problem This optimization problem can be solved many different ways We ve been using the convex relaxation formulation for the power flow equations (Lavaei, Low) because we really want (provably) the minimum solution. The problem has a feasible solution The optimization using the convex relaxation can be solved for a global minimum (and hopefully a feasible power flow solution). 15
16 Relaxed Problem Formulation In Rectangular coordinates, define Then, power flow equations can be written in the form where Which is a rank one matrix by construction. 16
17 Relaxed Problem Formulation The convex relaxation is introduced by relaxing the rank of W. With that, we pose the following convex optimization problem: 17
18 Semidefinite Relaxation Example MISDP 18
19 Semidefinite Relaxation Example MISDP 19
20 Bonus result concerning solution to the power flow equations The existence of a power flow solution requires Necessary, but not sufficient, condition for existence Conversely, no solution exists if Sufficient, but not necessary, condition for nonexistence 20
21 Controlled Voltage Margin A controlled voltage margin to the solvability boundary Upper bound (nonconservative) No power flow solution exists for Increasing the slack bus voltage (with proportional increases in PV bus voltages) by at least is required for solution. 21
22 Power Injection Margin Uniformly scaling all power injections scales Uniformly scale power injections until Corresponding gives a power flow voltage stability margin in the direction of uniformly increasing power injections at constant power factor. indicates that no solution exists for the original power flow problem 22
23 Power Injection Margin The power injection margin answers the question For a given voltage profile, by what factor can we change our power injections (uniformly at all buses) while still potentially having a solution? Answer: 23
24 Examples IEEE 14Bus System IEEE 118Bus System Tested many other systems and loadings 24
25 Controlled Voltage Margin 1.1 IEEE 14Bus Continuation Trace: Bus V Injection Multiplier 25
26 Power Injection Margin 1.1 IEEE 14Bus Continuation Trace: Bus V Injection Multiplier 26
27 IEEE 14 Bus System Injection Multiplier Newton Raphson Converged? dim(null(a) Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No No No No No No No
28 Voltage Margin 28
29 Voltage and Power Injection Margins 1.2 IEEE 14Bus Continuation Trace: Bus V Injection Multiplier 29
30 Controlled Voltage Margin IEEE 118Bus Continuation Trace: Bus V Injection Multiplier 30
31 Power Injection Margin IEEE 118Bus Continuation Trace: Bus V Injection Multiplier 31
32 IEEE 118 Bus System Injection Multiplier Newton Raphson Converged? (lower bound) dim(null(a) 1.00 Yes Yes Yes Yes Yes Yes Yes Yes Yes No No No No No No No No No No No No
33 Voltage Margin IEEE 118 Bus System 33
34 Voltage and Power Injection Margins 1.2 IEEE 118Bus Continuation Trace: Bus V Injection Multiplier 34
35 Alternate Power Injection Profiles Power injection margin is in the direction of a uniform, constantpowerfactor injection profile We can alternatively specify any profile that is a linear function of powers and squared voltages However, insolvability condition is not necessarily valid 35
36 Reactive Power Limits Previous work models generators as ideal voltage sources Detailed models limit reactive outputs Limitinduced bifurcations Two approaches to modeling these limits: Reactive Power versus Voltage Magnitude Characteristic Q max Reactive Power Q min Mixedinteger semidefinite programming Infeasibility certificates using sum of squares programming 0 V Voltage Magnitude 36
37 MISDP Formulation Model reactive power limits using binary variables Reactive Power versus Voltage Magnitude Characteristic Q max Reactive Power Q min 0 V Voltage Magnitude Insolvability 37
38 MISDP Formulation Model reactive power limits using binary variables Reactive Power versus Voltage Magnitude Characteristic Q max Reactive Power Q min 0 V Voltage Magnitude Insolvability 38
39 MISDP Formulation Model reactive power limits using binary variables Reactive Power versus Voltage Magnitude Characteristic Q max Reactive Power Q min 0 V Voltage Magnitude Insolvability 39
40 MISDP Formulation Model reactive power limits using binary variables Reactive Power versus Voltage Magnitude Characteristic Q max Reactive Power Q min 0 V Voltage Magnitude Insolvability 40
41 Reactive Power Limits Results Bus System Power vs. Voltage V PV Curve 0.99 η max Infeasibility Certificate Found PQ Bus Injection Multiplier 41
42 Conclusions Cast the problem of computing voltage stability margins as an optimization problem to minimize the slack bus voltage. Calculated voltage stability margins power injection/flows, and controlled voltages. Tested with numerical examples Advantages: Eliminates repeated solution (multiple power flows, continuation power flows) Often offers provably globally optimal results Works when the margin is negative, i.e. when there isn t a solution. 42
43 Related Publications [1] B.C. Lesieutre, D.K. Molzahn, A.R. Borden, and C.L. DeMarco, Examining the Limits of the Application of Semidefinite Programming to Power Flow Problems, 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2011, pp , Sept [2] D.K. Molzahn, J.T. Holzer, and B.C. Lesieutre, and C.L. DeMarco, Implementation of a Large Scale Optimal Power Flow Solver Based on Semidefinite Programming, To appear in IEEE Transactions on Power Systems. [3] D.K. Molzahn, B.C. Lesieutre, and C.L. DeMarco, An Approximate Method for Modeling ZIP Loads in a Semidefinite Relaxation of the OPF Problem, submitted to IEEE Transactions on Power Systems, Letters. [4] D.K. Molzahn, B.C. Lesieutre, and C.L. DeMarco, "A Sufficient Condition for Global Optimality of Solutions to the Optimal Power Flow Problem, to appear in IEEE Transactions on Power Systems, Letters. [5] D.K. Molzahn, B.C. Lesieutre, and C.L. DeMarco, A Sufficient Condition for Power Flow Insolvability with Applications to Voltage Stability Margins, IEEE Transactions on Power Systems, Vol 28, No. 3, pp [6] D.K. Molzahn, V. Dawar, B.C. Lesieutre, and C.L. DeMarco, Sufficient Conditions for Power Flow Insolvability Considering Reactive Power Limited Generators with Applications to Voltage Stability Margins, presented at Bulk Power System Dynamics and Control  IX. Optimization, Security and Control of the Emerging Power Grid, 2013 IREP Symposium, Aug [7] D.K. Molzahn, B.C. Lesieutre, and C.L. DeMarco, Investigation of NonZero Duality Gap Solutions to a Semidefinite Relaxation of the Power Flow Equations, To be presented at the Hawaii International Conference on System Sciences, January Conclusion 43
44 Questions? 44
45 Extra Slides: Feasibility 45
46 Feasibility For lossless systems: 1. Show a solution exists for zero power injections at PQ buses and zero active power injection at PV buses, for α = Use implicit function theorem to argue that perturbations to zero power injections solutions also exist. Specifically choose one in the direction of desired power injection profile. 3. Exploit the quadratic nature of power flow equations to scale voltages and power to match injection profile. 46
47 Feasibility: Zero Power Injection Solution Easy: Construct a solution. Open Circuit PQ buses for zero power, zero current injection. Use Wardtype reduction to eliminate PQ buses. (not really necessary, but clean) small print Choose uniform angle solution for all buses. Directly use reactive power flow equation to calculated the reactive power injections at generator buses
48 Note: Zero Power Injection Solutions for Lossy Systems Not all systems have a zeropower injection solution Ability to choose θ such that P PV = 0 depends on Ratio of V PV to V slack Ratio of g to b Systems with small resistances and small voltage magnitude differences are expected to have a zero power injection solution 48
49 Nearby Solutions A nearby nonzero solution exists provided the Jacobian is nonsingular. For a connected lossless system at the zeropower injection solution, the appropriate Jacobian is nonsingular, generically. small print 49
50 Feasible Solution Exploit the quadratic nature of power flow equations to scale voltages to match desired power profile: 50
51 Extra Slides: Infeasibility Certificates 51
52 Infeasibility Certificates Guarantee that a system of polynomial is infeasible Positivstellensatz Theorem If such that then the system of polynomials has no solution 52
53 Power Flow in Polynomial Form Power Injection and Voltage Magnitude Polynomials Reactive Power Limit Polynomials Reactive Power versus Voltage Magnitude Characteristic Q max Reactive Power Q min 0 V Voltage Magnitude 53
54 Power Flow Infeasibility Certificates Find a sum of squares polynomial of the form such that by finding polynomials and sum of squares polynomials Then the power flow equations have no solution. 54
Power System Analysis Prof. A. K. Sinha Department of Electrical Engineering Indian Institute of Technology, Kharagpur. Lecture  19 Power Flow IV
Power System Analysis Prof. A. K. Sinha Department of Electrical Engineering Indian Institute of Technology, Kharagpur Lecture  19 Power Flow IV Welcome to lesson 19 on Power System Analysis. In this
More informationA Direct Numerical Method for Observability Analysis
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 15, NO 2, MAY 2000 625 A Direct Numerical Method for Observability Analysis Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper presents an algebraic method
More informationA progressive method to solve largescale AC Optimal Power Flow with discrete variables and control of the feasibility
A progressive method to solve largescale AC Optimal Power Flow with discrete variables and control of the feasibility Manuel Ruiz, Jean Maeght, Alexandre Marié, Patrick Panciatici and Arnaud Renaud manuel.ruiz@artelys.com
More informationSteadyState Power System Security Analysis with PowerWorld Simulator
SteadyState Power System Security Analysis with PowerWorld Simulator S: Power System Modeling Methods and Equations 00 South First Street Champaign, Illinois 680 + (7) 384.6330 support@powerworld.com
More informationEmail: mod_modaber@yahoo.com. 2Azerbaijan Shahid Madani University. This paper is extracted from the M.Sc. Thesis
Introduce an Optimal Pricing Strategy Using the Parameter of "Contingency Analysis" Neplan Software in the Power Market Case Study (Azerbaijan Electricity Network) ABSTRACT Jalil Modabe 1, Navid Taghizadegan
More informationLoad Flow Analysis on IEEE 30 bus System
International Journal of Scientific and Research Publications, Volume 2, Issue 11, November 2012 1 Load Flow Analysis on IEEE 30 bus System Dharamjit *, D.K.Tanti ** * Department of Electrical Engineering,
More informationECE 740. Optimal Power Flow
ECE 740 Optimal Power Flow 1 Economic Dispatch A B C L Objective: minimize the cost of generation Constraints Equality constraint: load generation balance Inequality constraints: upper and lower limits
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 3. Symmetrical Components & Faults Calculations
SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 3 3.0 Introduction Fortescue's work proves that an unbalanced system of 'n' related phasors can be resolved into 'n' systems of balanced phasors called the
More informationME128 ComputerAided Mechanical Design Course Notes Introduction to Design Optimization
ME128 Computerided Mechanical Design Course Notes Introduction to Design Optimization 2. OPTIMIZTION Design optimization is rooted as a basic problem for design engineers. It is, of course, a rare situation
More informationIMPROVED NETWORK PARAMETER ERROR IDENTIFICATION USING MULTIPLE MEASUREMENT SCANS
IMPROVED NETWORK PARAMETER ERROR IDENTIFICATION USING MULTIPLE MEASUREMENT SCANS Liuxi Zhang and Ali Abur Department of Electrical and Computer Engineering Northeastern University Boston, MA, USA lzhang@ece.neu.edu
More informationOptimization Modeling for Mining Engineers
Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2
More informationNonlinear Optimization: Algorithms 3: Interiorpoint methods
Nonlinear Optimization: Algorithms 3: Interiorpoint methods INSEAD, Spring 2006 JeanPhilippe Vert Ecole des Mines de Paris JeanPhilippe.Vert@mines.org Nonlinear optimization c 2006 JeanPhilippe Vert,
More informationMath 407A: Linear Optimization
Math 407A: Linear Optimization Lecture 4: LP Standard Form 1 1 Author: James Burke, University of Washington LPs in Standard Form Minimization maximization Linear equations to linear inequalities Lower
More informationHybrid processing of SCADA and synchronized phasor measurements for tracking network state
IEEE PES General Meeting, Denver, USA, July 2015 1 Hybrid processing of SCADA and synchronized phasor measurements for tracking network state Boris AlcaideMoreno Claudio FuerteEsquivel Universidad Michoacana
More informationDistributed Flexible AC Transmission System (D FACTS) Jamie Weber. weber@powerworld.com, 217 384 6330 ext. 13
Distributed Flexible AC Transmission System (D FACTS) Jamie Weber weber@powerworld.com, 217 384 6330 ext. 13 Slide Preparation: Kate Rogers Davis kate@powerworld.com, 217 384 6330, Ext 14 2001 South First
More informationBy W.E. Diewert. July, Linear programming problems are important for a number of reasons:
APPLIED ECONOMICS By W.E. Diewert. July, 3. Chapter : Linear Programming. Introduction The theory of linear programming provides a good introduction to the study of constrained maximization (and minimization)
More informationPower Trading and Congestion Management through Real Power Rescheduling Using Unified Power Flow Controller
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol. 2, No. 4, December 2014, pp. 151~160 ISSN: 20893272 151 Power Trading and Congestion Management through Real Power Rescheduling
More informationIntroduction to Support Vector Machines. Colin Campbell, Bristol University
Introduction to Support Vector Machines Colin Campbell, Bristol University 1 Outline of talk. Part 1. An Introduction to SVMs 1.1. SVMs for binary classification. 1.2. Soft margins and multiclass classification.
More informationOPTIMAL DISPATCH OF POWER GENERATION SOFTWARE PACKAGE USING MATLAB
OPTIMAL DISPATCH OF POWER GENERATION SOFTWARE PACKAGE USING MATLAB MUHAMAD FIRDAUS BIN RAMLI UNIVERSITI MALAYSIA PAHANG v ABSTRACT In the reality practical power system, power plants are not at the same
More informationLinear Programming, Lagrange Multipliers, and Duality Geoff Gordon
lp.nb 1 Linear Programming, Lagrange Multipliers, and Duality Geoff Gordon lp.nb 2 Overview This is a tutorial about some interesting math and geometry connected with constrained optimization. It is not
More informationIN restructured power systems, securityconstrained unit
2144 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 22, NO. 4, NOVEMBER 2007 Fast SCUC for LargeScale Power Systems Yong Fu, Member, IEEE, and Mohammad Shahidehpour, Fellow, IEEE Abstract In restructured power
More informationDefinition of a Linear Program
Definition of a Linear Program Definition: A function f(x 1, x,..., x n ) of x 1, x,..., x n is a linear function if and only if for some set of constants c 1, c,..., c n, f(x 1, x,..., x n ) = c 1 x 1
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationZeros of Polynomial Functions
Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n1 x n1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of
More informationPower System Security in Market Clearing and Dispatch Mechanisms
1 Power System Security in Market Clearing and Dispatch Mechanisms Claudio A. Cañizares, Senior Member, IEEE, Sameh K. M. Kodsi, Student Member, IEEE Abstract This paper presents and discusses some typical
More informationOptimal Branch Exchange for Feeder Reconfiguration in Distribution Networks
Optimal Branch Exchange for Feeder Reconfiguration in Distribution Networks Qiuyu Peng and Steven H. Low Engr. & App. Sci., Caltech, CA Abstract The feeder reconfiguration problem chooses the on/off status
More informationSupport Vector Machines Explained
March 1, 2009 Support Vector Machines Explained Tristan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introduction This document has been written in an attempt to make the Support Vector Machines (SVM),
More informationOptimization based method to consolidate European Transmission Data
Optimization based method to consolidate European Transmission Data Manuel Ruiz Michael Gabay Artelys Paris, France Jean Maeght Mireille Lefevre Patrick Panciatici RTE Versailles, France Abstract In this
More informationLecture 4 Linear Programming Models: Standard Form. August 31, 2009
Linear Programming Models: Standard Form August 31, 2009 Outline: Lecture 4 Standard form LP Transforming the LP problem to standard form Basic solutions of standard LP problem Operations Research Methods
More informationImproving Market Clearing Software Performance to Meet Existing and Future Challenges MISO s Perspective
Improving Market Clearing Software Performance to Meet Existing and Future Challenges MISO s Perspective FERC Technical Conference on Increasing RealTime and DayAhead Market Efficiency through Improved
More informationIEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2
IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3
More informationStudent Project Allocation Using Integer Programming
IEEE TRANSACTIONS ON EDUCATION, VOL. 46, NO. 3, AUGUST 2003 359 Student Project Allocation Using Integer Programming A. A. Anwar and A. S. Bahaj, Member, IEEE Abstract The allocation of projects to students
More informationFast analytical techniques for electrical and electronic circuits. Jet Propulsion Laboratory California Institute of Technology
Fast analytical techniques for electrical and electronic circuits Vatché Vorpérian Jet Propulsion Laboratory California Institute of Technology PUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGE
More informationNumerisches Rechnen. (für Informatiker) M. Grepl J. Berger & J.T. Frings. Institut für Geometrie und Praktische Mathematik RWTH Aachen
(für Informatiker) M. Grepl J. Berger & J.T. Frings Institut für Geometrie und Praktische Mathematik RWTH Aachen Wintersemester 2010/11 Problem Statement Unconstrained Optimality Conditions Constrained
More informationDetermining Feasible Solution in Imprecise Linear Inequality Systems
Applied Mathematical Sciences, Vol. 2, 2008, no. 36, 17891797 Determining Feasible Solution in Imprecise Linear Inequality Systems A. A. Noura and F. H. Saljooghi Department of Mathematics Sistan and
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
More informationAlgebra 1 Course Title
Algebra 1 Course Title Course wide 1. What patterns and methods are being used? Course wide 1. Students will be adept at solving and graphing linear and quadratic equations 2. Students will be adept
More informationChap 4 The Simplex Method
The Essence of the Simplex Method Recall the Wyndor problem Max Z = 3x 1 + 5x 2 S.T. x 1 4 2x 2 12 3x 1 + 2x 2 18 x 1, x 2 0 Chap 4 The Simplex Method 8 corner point solutions. 5 out of them are CPF solutions.
More informationParameter Estimation: A Deterministic Approach using the LevenburgMarquardt Algorithm
Parameter Estimation: A Deterministic Approach using the LevenburgMarquardt Algorithm John Bardsley Department of Mathematical Sciences University of Montana Applied Math SeminarFeb. 2005 p.1/14 Outline
More informationWeightedLeastSquare(WLS) State Estimation
WeightedLeastSquare(WLS) State Estimation Yousu Chen PNNL December 18, 2015 This document is a description of how to formulate the weightedleast squares (WLS) state estimation problem. Most of the formulation
More informationDiscrete Optimization
Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.14.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 20150331 Todays presentation Chapter 3 Transforms using
More informationSolving polynomial least squares problems via semidefinite programming relaxations
Solving polynomial least squares problems via semidefinite programming relaxations Sunyoung Kim and Masakazu Kojima August 2007, revised in November, 2007 Abstract. A polynomial optimization problem whose
More informationSoftware Implementation of Online RiskBased Security Assessment
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 18, NO. 3, AUGUST 2003 1165 Software Implementation of Online RiskBased Security Assessment Ming Ni, Member, IEEE, James D. McCalley, Senior Member, IEEE, Vijay
More informationBackground: State Estimation
State Estimation Cyber Security of the Smart Grid Dr. Deepa Kundur Background: State Estimation University of Toronto Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 1 / 81 Dr.
More informationDuality in General Programs. Ryan Tibshirani Convex Optimization 10725/36725
Duality in General Programs Ryan Tibshirani Convex Optimization 10725/36725 1 Last time: duality in linear programs Given c R n, A R m n, b R m, G R r n, h R r : min x R n c T x max u R m, v R r b T
More informationTransmission Loss Allocation: A Comparison of Different Practical Algorithms
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 17, NO. 3, AUGUST 2002 571 Transmission Loss Allocation: A Comparison of Different Practical Algorithms A. J. Conejo, Senior Member, IEEE, J. M. Arroyo, Member,
More informationA Network Flow Approach in Cloud Computing
1 A Network Flow Approach in Cloud Computing Soheil Feizi, Amy Zhang, Muriel Médard RLE at MIT Abstract In this paper, by using network flow principles, we propose algorithms to address various challenges
More informationSome Optimization Fundamentals
ISyE 3133B Engineering Optimization Some Optimization Fundamentals Shabbir Ahmed Email: sahmed@isye.gatech.edu Homepage: www.isye.gatech.edu/~sahmed Basic Building Blocks min or max s.t. objective as
More informationMinimize subject to. x S R
Chapter 12 Lagrangian Relaxation This chapter is mostly inspired by Chapter 16 of [1]. In the previous chapters, we have succeeded to find efficient algorithms to solve several important problems such
More informationLecture 3: Linear Programming Relaxations and Rounding
Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can
More informationLAGRANGIAN RELAXATION TECHNIQUES FOR LARGE SCALE OPTIMIZATION
LAGRANGIAN RELAXATION TECHNIQUES FOR LARGE SCALE OPTIMIZATION Kartik Sivaramakrishnan Department of Mathematics NC State University kksivara@ncsu.edu http://www4.ncsu.edu/ kksivara SIAM/MGSA Brown Bag
More informationAbsolute Value Programming
Computational Optimization and Aplications,, 1 11 (2006) c 2006 Springer Verlag, Boston. Manufactured in The Netherlands. Absolute Value Programming O. L. MANGASARIAN olvi@cs.wisc.edu Computer Sciences
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationA linear algebraic method for pricing temporary life annuities
A linear algebraic method for pricing temporary life annuities P. Date (joint work with R. Mamon, L. Jalen and I.C. Wang) Department of Mathematical Sciences, Brunel University, London Outline Introduction
More informationLinear Dependence Tests
Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationLecture 11: 01 Quadratic Program and Lower Bounds
Lecture :  Quadratic Program and Lower Bounds (3 units) Outline Problem formulations Reformulation: Linearization & continuous relaxation Branch & Bound Method framework Simple bounds, LP bound and semidefinite
More informationSupport Vector Machine (SVM)
Support Vector Machine (SVM) CE725: Statistical Pattern Recognition Sharif University of Technology Spring 2013 Soleymani Outline Margin concept HardMargin SVM SoftMargin SVM Dual Problems of HardMargin
More informationMATHEMATICS (CLASSES XI XII)
MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)
More informationStudy Guide 2 Solutions MATH 111
Study Guide 2 Solutions MATH 111 Having read through the sample test, I wanted to warn everyone, that I might consider asking questions involving inequalities, the absolute value function (as in the suggested
More informationThe multiinteger set cover and the facility terminal cover problem
The multiinteger set cover and the facility teral cover problem Dorit S. Hochbaum Asaf Levin December 5, 2007 Abstract The facility teral cover problem is a generalization of the vertex cover problem.
More informationMATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.
MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted
More informationEconomics 326: Marshallian Demand and Comparative Statics. Ethan Kaplan
Economics 326: Marshallian Demand and Comparative Statics Ethan Kaplan September 17, 2012 Outline 1. Utility Maximization: General Formulation 2. Marshallian Demand 3. Homogeneity of Degree Zero of Marshallian
More informationLinear Least Squares
Linear Least Squares Suppose we are given a set of data points {(x i,f i )}, i = 1,...,n. These could be measurements from an experiment or obtained simply by evaluating a function at some points. One
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LUdecomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationSample Problems. Practice Problems
Lecture Notes Factoring by the ACmethod page 1 Sample Problems 1. Completely factor each of the following. a) 4a 2 mn 15abm 2 6abmn + 10a 2 m 2 c) 162a + 162b 2ax 4 2bx 4 e) 3a 2 5a 2 b) a 2 x 3 b 2 x
More informationCHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORTTERM HYDROTHERMAL SCHEDULING
60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORTTERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal shortterm hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationChapter 10: Network Flow Programming
Chapter 10: Network Flow Programming Linear programming, that amazingly useful technique, is about to resurface: many network problems are actually just special forms of linear programs! This includes,
More informationOptimal Power Flow Analysis of Energy Storage for Congestion Relief, Emissions Reduction, and Cost Savings
1 Optimal Power Flow Analysis of Energy Storage for Congestion Relief, Emissions Reduction, and Cost Savings Zhouxing Hu, Student Member, IEEE, and Ward T. Jewell, Fellow, IEEE Abstract AC optimal power
More informationAn Overview Of Software For Convex Optimization. Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt.
An Overview Of Software For Convex Optimization Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt.edu In fact, the great watershed in optimization isn t between linearity
More informationApproximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai
Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques My T. Thai 1 Overview An overview of LP relaxation and rounding method is as follows: 1. Formulate an optimization
More informationNETWORK RECONFIGURATION FOR LOSS REDUCTION IN THREEPHASE POWER DISTRIBUTION SYSTEMS
NETWORK RECONFIGURATION FOR LOSS REDUCTION IN THREEPHASE POWER DISTRIBUTION SYSTEMS A Thesis Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements
More informationA FIRST COURSE IN OPTIMIZATION THEORY
A FIRST COURSE IN OPTIMIZATION THEORY RANGARAJAN K. SUNDARAM New York University CAMBRIDGE UNIVERSITY PRESS Contents Preface Acknowledgements page xiii xvii 1 Mathematical Preliminaries 1 1.1 Notation
More informationInterior Point Methods and Linear Programming
Interior Point Methods and Linear Programming Robert Robere University of Toronto December 13, 2012 Abstract The linear programming problem is usually solved through the use of one of two algorithms: either
More informationAlgebra 2 Chapter 1 Vocabulary. identity  A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity  A statement that equates two equivalent expressions. verbal model A word equation that represents a reallife problem. algebraic expression  An expression with variables.
More informationManipulator Kinematics. Prof. Matthew Spenko MMAE 540: Introduction to Robotics Illinois Institute of Technology
Manipulator Kinematics Prof. Matthew Spenko MMAE 540: Introduction to Robotics Illinois Institute of Technology Manipulator Kinematics Forward and Inverse Kinematics 2D Manipulator Forward Kinematics Forward
More informationA QCQP Approach to Triangulation. Chris Aholt, Sameer Agarwal, and Rekha Thomas University of Washington 2 Google, Inc.
A QCQP Approach to Triangulation 1 Chris Aholt, Sameer Agarwal, and Rekha Thomas 1 University of Washington 2 Google, Inc. 2 1 The Triangulation Problem X Given: n camera matrices P i R 3 4 n noisy observations
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationGeometric Constraints
Simulation in Computer Graphics Geometric Constraints Matthias Teschner Computer Science Department University of Freiburg Outline introduction penalty method Lagrange multipliers local constraints University
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 WeiTa Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationArithmetic and Algebra of Matrices
Arithmetic and Algebra of Matrices Math 572: Algebra for Middle School Teachers The University of Montana 1 The Real Numbers 2 Classroom Connection: Systems of Linear Equations 3 Rational Numbers 4 Irrational
More informationA Numerical Study on the Wiretap Network with a Simple Network Topology
A Numerical Study on the Wiretap Network with a Simple Network Topology Fan Cheng and Vincent Tan Department of Electrical and Computer Engineering National University of Singapore Mathematical Tools of
More informationSlide 1 / 26. Inductance. 2011 by Bryan Pflueger
Slide 1 / 26 Inductance 2011 by Bryan Pflueger Slide 2 / 26 Mutual Inductance If two coils of wire are placed near each other and have a current passing through them, they will each induce an emf on one
More informationZeros of Polynomial Functions
Review: Synthetic Division Find (x 25x  5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 35x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 35x 2 + x + 2. Zeros of Polynomial Functions Introduction
More informationIntegrating Benders decomposition within Constraint Programming
Integrating Benders decomposition within Constraint Programming Hadrien Cambazard, Narendra Jussien email: {hcambaza,jussien}@emn.fr École des Mines de Nantes, LINA CNRS FRE 2729 4 rue Alfred Kastler BP
More informationpp. 4 8: Examples 1 6 Quick Check 1 6 Exercises 1, 2, 20, 42, 43, 64
Semester 1 Text: Chapter 1: Tools of Algebra Lesson 11: Properties of Real Numbers Day 1 Part 1: Graphing and Ordering Real Numbers Part 1: Graphing and Ordering Real Numbers Lesson 12: Algebraic Expressions
More informationLecture 1: Linear Programming Models. Readings: Chapter 1; Chapter 2, Sections 1&2
Lecture 1: Linear Programming Models Readings: Chapter 1; Chapter 2, Sections 1&2 1 Optimization Problems Managers, planners, scientists, etc., are repeatedly faced with complex and dynamic systems which
More informationMultiobjective Optimization for Pricing System Security in Electricity Markets
596 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 18, NO. 2, MAY 2003 Multiobjective Optimization for Pricing System Security in Electricity Markets Federico Milano, Student Member, IEEE, Claudio A. Cañizares,
More informationChapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints
Chapter 6 Linear Programming: The Simplex Method Introduction to the Big M Method In this section, we will present a generalized version of the simplex method that t will solve both maximization i and
More information(Refer Slide Time: 00:00:56 min)
Numerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology, Delhi Lecture No # 3 Solution of Nonlinear Algebraic Equations (Continued) (Refer Slide
More informationPractice Final Math 122 Spring 12 Instructor: Jeff Lang
Practice Final Math Spring Instructor: Jeff Lang. Find the limit of the sequence a n = ln (n 5) ln (3n + 8). A) ln ( ) 3 B) ln C) ln ( ) 3 D) does not exist. Find the limit of the sequence a n = (ln n)6
More informationThnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
More informationProblem 1 (10 pts) Find the radius of convergence and interval of convergence of the series
1 Problem 1 (10 pts) Find the radius of convergence and interval of convergence of the series a n n=1 n(x + 2) n 5 n 1. n(x + 2)n Solution: Do the ratio test for the absolute convergence. Let a n =. Then,
More information( % . This matrix consists of $ 4 5 " 5' the coefficients of the variables as they appear in the original system. The augmented 3 " 2 2 # 2 " 3 4&
Matrices define matrix We will use matrices to help us solve systems of equations. A matrix is a rectangular array of numbers enclosed in parentheses or brackets. In linear algebra, matrices are important
More informationOPTIMAL POWER FLOW ALGORITHMS
OPTIMAL POWER FLOW ALGORITHMS Hans Glavitsch, Rainer Bacher Swiss Federal Institute of Technology CH8092 Zürich, Switzerland 1 PROBLEM DEFINITION 1.1 Optimal power flow problem 1.1.1 The ordinary power
More informationProximal mapping via network optimization
L. Vandenberghe EE236C (Spring 234) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:
More information