A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse
|
|
|
- Shawn Bailey
- 10 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 Wisconsin-Madison 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 post-contingency operating point to the nose point on a power-voltage 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 post-contingency operating point exists! 5
6 Typical Approach Run post-contingency 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 problem-specified 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 non-existence 20
21 Controlled Voltage Margin A controlled voltage margin to the solvability boundary Upper bound (non-conservative) 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 14-Bus System IEEE 118-Bus System Tested many other systems and loadings 24
25 Controlled Voltage Margin 1.1 IEEE 14-Bus Continuation Trace: Bus V Injection Multiplier 25
26 Power Injection Margin 1.1 IEEE 14-Bus 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 14-Bus Continuation Trace: Bus V Injection Multiplier 29
30 Controlled Voltage Margin IEEE 118-Bus Continuation Trace: Bus V Injection Multiplier 30
31 Power Injection Margin IEEE 118-Bus 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 118-Bus Continuation Trace: Bus V Injection Multiplier 34
35 Alternate Power Injection Profiles Power injection margin is in the direction of a uniform, constant-power-factor 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 Limit-induced bifurcations Two approaches to modeling these limits: Reactive Power versus Voltage Magnitude Characteristic Q max Reactive Power Q min Mixed-integer 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 P-V 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 Non-Zero 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 Ward-type 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 zero-power 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 non-zero solution exists provided the Jacobian is nonsingular. For a connected lossless system at the zero-power 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
A progressive method to solve large-scale AC Optimal Power Flow with discrete variables and control of the feasibility
A progressive method to solve large-scale AC Optimal Power Flow with discrete variables and control of the feasibility Manuel Ruiz, Jean Maeght, Alexandre Marié, Patrick Panciatici and Arnaud Renaud [email protected]
A 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
Steady-State Power System Security Analysis with PowerWorld Simulator
Steady-State Power System Security Analysis with PowerWorld Simulator S: Power System Modeling Methods and Equations 00 South First Street Champaign, Illinois 680 + (7) 384.6330 [email protected]
Email: [email protected]. 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
Load 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,
SAMPLE 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
Nonlinear Optimization: Algorithms 3: Interior-point methods
Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris [email protected] Nonlinear optimization c 2006 Jean-Philippe Vert,
Optimization 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
Hybrid 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 Alcaide-Moreno Claudio Fuerte-Esquivel Universidad Michoacana
IMPROVED 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 [email protected]
Introduction 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 multi-class classification.
OPTIMAL 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
Power 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
Distributed Flexible AC Transmission System (D FACTS) Jamie Weber. [email protected], 217 384 6330 ext. 13
Distributed Flexible AC Transmission System (D FACTS) Jamie Weber [email protected], 217 384 6330 ext. 13 Slide Preparation: Kate Rogers Davis [email protected], 217 384 6330, Ext 14 2001 South First
Zeros of Polynomial Functions
Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + 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
Optimal 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
Support 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),
Fast 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
Linear 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.
Weighted-Least-Square(WLS) State Estimation
Weighted-Least-Square(WLS) State Estimation Yousu Chen PNNL December 18, 2015 This document is a description of how to formulate the weighted-least squares (WLS) state estimation problem. Most of the formulation
Solving 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
IN restructured power systems, security-constrained unit
2144 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 22, NO. 4, NOVEMBER 2007 Fast SCUC for Large-Scale Power Systems Yong Fu, Member, IEEE, and Mohammad Shahidehpour, Fellow, IEEE Abstract In restructured power
Improving 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 Real-Time and Day-Ahead Market Efficiency through Improved
Duality in General Programs. Ryan Tibshirani Convex Optimization 10-725/36-725
Duality in General Programs Ryan Tibshirani Convex Optimization 10-725/36-725 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
Student 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
Background: 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.
Numerisches 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
A 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
Notes 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
Lecture 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
Linear 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
Lecture 11: 0-1 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
Discrete Optimization
Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.1-4.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 2015-03-31 Todays presentation Chapter 3 Transforms using
Support Vector Machine (SVM)
Support Vector Machine (SVM) CE-725: Statistical Pattern Recognition Sharif University of Technology Spring 2013 Soleymani Outline Margin concept Hard-Margin SVM Soft-Margin SVM Dual Problems of Hard-Margin
A 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
Dynamic Network Energy Management via Proximal Message Passing
Foundations and Trends R in Optimization Vol. 1, No. 2 (2013) 70 122 c 2013 M. Kraning, E. Chu, J. Lavaei, and S. Boyd DOI: xxx Dynamic Network Energy Management via Proximal Message Passing Matt Kraning
IEOR 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
Algebra 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
Optimal 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
Interior 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
LINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING
60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal short-term hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations
An 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 [email protected] In fact, the great watershed in optimization isn t between linearity
Arithmetic 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
2.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
A 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
Duality 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
5 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
Nonlinear 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
Integrating 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
Algebra 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 real-life problem. algebraic expression - An expression with variables.
Date: April 12, 2001. Contents
2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........
Zeros of Polynomial Functions
Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction
Proximal mapping via network optimization
L. Vandenberghe EE236C (Spring 23-4) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:
NETWORK RECONFIGURATION FOR LOSS REDUCTION IN THREE-PHASE POWER DISTRIBUTION SYSTEMS
NETWORK RECONFIGURATION FOR LOSS REDUCTION IN THREE-PHASE POWER DISTRIBUTION SYSTEMS A Thesis Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements
Study 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
Practice 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
THE 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
Chapter 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
Similar matrices and Jordan form
Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive
Chapter 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,
Increasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
Several Views of Support Vector Machines
Several Views of Support Vector Machines Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007 Tikhonov Regularization We are considering algorithms of the form min
A 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
Network Traffic Modelling
University of York Dissertation submitted for the MSc in Mathematics with Modern Applications, Department of Mathematics, University of York, UK. August 009 Network Traffic Modelling Author: David Slade
Reconnect 04 Solving Integer Programs with Branch and Bound (and Branch and Cut)
Sandia is a ultiprogra laboratory operated by Sandia Corporation, a Lockheed Martin Copany, Reconnect 04 Solving Integer Progras with Branch and Bound (and Branch and Cut) Cynthia Phillips (Sandia National
Equilibrium computation: Part 1
Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium
Application of GA for Optimal Location of FACTS Devices for Steady State Voltage Stability Enhancement of Power System
I.J. Intelligent Systems and Applications, 2014, 03, 69-75 Published Online February 2014 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijisa.2014.03.07 Application of GA for Optimal Location of Devices
Thnkwell 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
Efficient Curve Fitting Techniques
15/11/11 Life Conference and Exhibition 11 Stuart Carroll, Christopher Hursey Efficient Curve Fitting Techniques - November 1 The Actuarial Profession www.actuaries.org.uk Agenda Background Outline of
Transmission 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,
Linear Programming Sensitivity Analysis
Linear Programming Sensitivity Analysis Massachusetts Institute of Technology LP Sensitivity Analysis Slide 1 of 22 Sensitivity Analysis Rationale Shadow Prices Definition Use Sign Range of Validity Opportunity
Elliptic Curve Hash (and Sign)
Elliptic Curve Hash (and Sign) (and the 1-up problem for ECDSA) Daniel R. L. Brown Certicom Research ECC 2008, Utrecht, Sep 22-24 2008 Dan Brown (Certicom) Elliptic Curve Hash (and Sign) ECC 2008 1 / 43
Convex Programming Tools for Disjunctive Programs
Convex Programming Tools for Disjunctive Programs João Soares, Departamento de Matemática, Universidade de Coimbra, Portugal Abstract A Disjunctive Program (DP) is a mathematical program whose feasible
A Simple Introduction to Support Vector Machines
A Simple Introduction to Support Vector Machines Martin Law Lecture for CSE 802 Department of Computer Science and Engineering Michigan State University Outline A brief history of SVM Large-margin linear
Slide 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
Cost Models for Vehicle Routing Problems. 8850 Stanford Boulevard, Suite 260 R. H. Smith School of Business
0-7695-1435-9/02 $17.00 (c) 2002 IEEE 1 Cost Models for Vehicle Routing Problems John Sniezek Lawerence Bodin RouteSmart Technologies Decision and Information Technologies 8850 Stanford Boulevard, Suite
8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
Support Vector Machines
Support Vector Machines Charlie Frogner 1 MIT 2011 1 Slides mostly stolen from Ryan Rifkin (Google). Plan Regularization derivation of SVMs. Analyzing the SVM problem: optimization, duality. Geometric
Geometric Constraints
Simulation in Computer Graphics Geometric Constraints Matthias Teschner Computer Science Department University of Freiburg Outline introduction penalty method Lagrange multipliers local constraints University
CS3220 Lecture Notes: QR factorization and orthogonal transformations
CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss
THIS paper describes MATPOWER, an open-source Matlab
1 MATPOWER: Steady-State Operations, Planning and Analysis Tools for Power Systems Research and Education Ray D. Zimmerman, Member, IEEE, Carlos E. Murillo-Sánchez, Member, IEEE, and Robert J. Thomas,
Transportation Polytopes: a Twenty year Update
Transportation Polytopes: a Twenty year Update Jesús Antonio De Loera University of California, Davis Based on various papers joint with R. Hemmecke, E.Kim, F. Liu, U. Rothblum, F. Santos, S. Onn, R. Yoshida,
Ideal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
Load Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: [email protected] Abstract Load
Cyber-Security Analysis of State Estimators in Power Systems
Cyber-Security Analysis of State Estimators in Electric Power Systems André Teixeira 1, Saurabh Amin 2, Henrik Sandberg 1, Karl H. Johansson 1, and Shankar Sastry 2 ACCESS Linnaeus Centre, KTH-Royal Institute
Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.
8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections 4.6 and 1.1) 8.1 Equivalent Inequalities Definition 8.1 Two inequalities are equivalent
Numerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
Sensitivity Analysis with Excel
Sensitivity Analysis with Excel 1 Lecture Outline Sensitivity Analysis Effects on the Objective Function Value (OFV): Changing the Values of Decision Variables Looking at the Variation in OFV: Excel One-
Optimal Design of α-β-(γ) Filters
Optimal Design of --(γ) Filters Dirk Tenne Tarunraj Singh, Center for Multisource Information Fusion State University of New York at Buffalo Buffalo, NY 426 Abstract Optimal sets of the smoothing parameter
How To Factor By Grouping
Lecture Notes Factoring by the AC-method 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
PowerWorld Simulator
PowerWorld Simulator Quick Start Guide 2001 South First Street Champaign, Illinois 61820 +1 (217) 384.6330 [email protected] http://www.powerworld.com Purpose This quick start guide is intended to
Linear Programming I
Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
Statistical Machine Learning
Statistical Machine Learning UoC Stats 37700, Winter quarter Lecture 4: classical linear and quadratic discriminants. 1 / 25 Linear separation For two classes in R d : simple idea: separate the classes
