SCED Security Constrained Economic Dispatch Linear vs. Quadratic Programming Model.

Slides:



Advertisements
Similar presentations
1 LP, extended maxflow, TRW OR: How to understand Vladimirs most recent work Ramin Zabih Cornell University.
Advertisements

Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Linear Programming Problem
Nonlinear Programming McCarl and Spreen Chapter 12.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Support Vector Machines Instructor Max Welling ICS273A UCIrvine.
SCED Power Balance Penalty Curve
Dragan Jovicic Harvinder Singh
Linear Programming: Simplex Method and Sensitivity Analysis
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Exact or stable image\signal reconstruction from incomplete information Project guide: Dr. Pradeep Sen UNM (Abq) Submitted by: Nitesh Agarwal IIT Roorkee.
Separating Hyperplanes
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Reformulated - SVR as a Constrained Minimization Problem subject to n+1+2m variables and 2m constrains minimization problem Enlarge the problem size and.
Computational Methods for Management and Economics Carla Gomes
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Unconstrained Optimization Problem
1 Linear Programming Using the software that comes with the book.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
I/O Curve The IO curve plots fuel input (in MBtu/hr) versus net MW output.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Spreadsheet Modeling & Decision Analysis:
LP formulation of Economic Dispatch
Introduction to Optimization (Part 1)
1 Least Cost System Operation: Economic Dispatch 2 Smith College, EGR 325 March 10, 2006.
Least Cost System Operation: Economic Dispatch 1
Introduction to Mathematical Programming OR/MA 504 Chapter 3.
Optimization for Operation of Power Systems with Performance Guarantee
Special Conditions in LP Models (sambungan BAB 1)
1 Chapter 8 Nonlinear Programming with Constraints.
EE/Econ 458 Introduction to Linear Programming J. McCalley 1.
Centraal Bureau voor de Statistiek Vincent Ohm National Accounts Statistics Netherlands (CBS) contribution for WPNA meeting contribution for WPNA meeting.
The Theory of the Simplex Method
Managerial Decision Making and Problem Solving
Chapter 7 Duality and Sensitivity in Linear Programming.
April, 2008 Maximum Shadow Price. April, 2008 Protocol Requirement: Transmission Constraint Management (2)ERCOT shall establish a maximum Shadow.
January 21, 2010 Security Constrained Economic Dispatch Resmi Surendran.
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
Part 4 Nonlinear Programming 4.5 Quadratic Programming (QP)
Slack Bus Change and Impact to Market Market Analysis, ERCOT QMWG Sep. 4, 2015.
1 Reliability Deployment Task Force (RDTF Meeting) December 20 th 2011 December 20, 2011.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
Congestion Management and Ramp Rate for Delivering Ancillary Services Resmi Surendran.
PJM©2013www.pjm.com Demand Side Working Group Loads in SCED Angelo Marcino Real-Time Market Operations – PJM April 14, 2014.
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
2.1 – Linear and Quadratic Equations Linear Equations.
1 Tests for Reasonable LMPs & Price Validation Tool Overview October 27, 2009 NATF.
Lecture 16 Economic Dispatch Professor Tom Overbye Department of Electrical and Computer Engineering ECE 476 POWER SYSTEM ANALYSIS.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Lecture notes for Stat 231: Pattern Recognition and Machine Learning 1. Stat 231. A.L. Yuille. Fall 2004 Linear Separation and Margins. Non-Separable and.
Computational Intelligence: Methods and Applications Lecture 24 SVM in the non-linear case Włodzisław Duch Dept. of Informatics, UMK Google: W Duch.
D Nagesh Kumar, IIScOptimization Methods: M8L1 1 Advanced Topics in Optimization Piecewise Linear Approximation of a Nonlinear Function.
2-1 Modeling with Linear Programming Chapter Optimal Solution for New Objective Function Graphical Solution of Maximization Model (12 of 12) Maximize.
RDTF June 1, Purpose “The effect of the Shadow Price cap for the Power Balance Constraint is to limit the cost calculated by the SCED optimization.
NPRR 520 Resmi Surendran ERCOT. Current CCT Process Annual CCT (ACCT) is run every year to feed the results to Monthly CCT (MCCT) MCCT is run every month.
Valley Import Constraint Resmi Surendran. Valley Import Constraint Range of SFs – to in valley area – 0.03 to outside valley area Not.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Announcements Please read Chapter 7 HW 6 is due today
Analysis of the Effects of a Flexible Ramping Ancillary Service Product on Power System Operations Ibrahim Krad Eduardo Ibanez Erik Ela.
Congestion Management and Ramp Rate for Delivering Ancillary Services
ME 312 PPE POWER SYSTEM ANALYSIS
EE 369 POWER SYSTEM ANALYSIS Lecture 15 Economic Dispatch Tom Overbye and Ross Baldick 1.
LMP calculations Congestion evaluation
The Simplex Method: Standard Minimization Problems
ECEN 460 Power System Operation and Control
Linear Programming Problem
Constraints.
EE/Econ 458 Introduction to Linear Programming
Presentation transcript:

SCED Security Constrained Economic Dispatch Linear vs. Quadratic Programming Model

When the initial requirements where written, a section was added as appendix (Section 8) to give a general understanding of the implementation. At that time, the understanding was that SCED would use Linear Programming. Later during the design phase it was concluded that the energy offer price curve would need to be considered as piece wise linear and also a piece wise linear offer price curve would automatically resolve breaking a tie in instances of multiple resources being marginal at the optimum. For these reasons SCED Quadratic Programming methodology was used. This is reflected correctly in the functional specification. While updating our SCED requirements document to include Baseline 1&2 changes we unfortunately missed to update the Appendix to reflect this change. We apologize for any confusion this may have caused and have provided an updated version of the SCED requirements for your review and comments. Also during previous TPTF meeting it was mentioned that Quadratic Programming could lead to duality gap issues. Since SCED problem is convex, the duality gap is zero and therefore we believe no issue exist. The LMP reasonability metric presented in the previous meeting is still valid and is NOT impacted by the use of Quadratic Programming.

Energy Offer Price Curve $/MWH MW P min Real Price Curve Piecewise Linear Approximation Stepwise Approximation P max

Optimization Cost Objective Each segment of Energy Price Curve is represented separately by segment variable The Energy Cost Curve (Objective Function) is equal to integral of (i.e. area under) Energy Price Curve Energy Price CurveEnergy Cost Curve (Objective Function) Piecewise Linear: P price = a slope ∙ P unit + b const Piecewise Quadratic: C cost = ½ ∙ a slope ∙ P 2 unit + P unit ∙ b const + c mincost Stepwise: P price = b const Piecewise Linear: C cost = b const ∙ P unit + c mincost The difference is quadratic term marked by red color P unit is the delta MW output from the start of the given price curve segment.

SCED – Mathematical Formulation Minimize Sum seg&unit { C cost = ½ ∙ a slope ∙ P 2 unit + P unit ∙ b const + c mincost } Subject to: sum seg&unit { P unit } = P load - Power balance sum seg&unit { SF unit/line ∙ P unit } ≤ Limit line - Transmission limits P min ≤ sum seg { P unit } ≤ P max - Unit limits Note: Optimization Objective is bounded, continuous and convex function (a slope ≥ 0) for each segment. For QP SCED a slope > 0 and for LP SCED a slope = 0. All constraints are linear, i.e. determine a convex set.

SCED – Optimality Conditions Lagrange Function: £ = sum seg&unit { ½ ∙ a slope ∙ P 2 unit + P unit ∙ b const + c mincost } + λ ∙ (P load – sum seg&unit { P unit }) + sum line { η line ∙ (Limit line – sum seg&unit { SF unit/line ∙ P unit } ) } Optimality Conditions: d£/dP unit = a slope ∙ P unit + b const - λ - sum line { η line ∙ SF unit/line } = 0 sum seg&unit { P unit } = P load sum seg&unit { SF unit/line ∙ P unit } + F slack = Limit line η line ∙ F slack = 0- complementary slackness P min ≤ sum seg {P unit }≤ P max ; F slack ≥ 0 Note: QP SCED has linear optimality conditions Complementary slackness is expressed for QP and LP in the same way

SCED – Duality Gap SCED QP Formulation: Bounded, continuous and convex optimization objective Linear, i.e. convex constrained set Theory QP Theory: Duality Gap = 0 SCED Implementation: Duality Gap ≤ ε (convergence tolerance, default $10 -4 )

SCED – Tie Breaking Rule SCED Requirement: Dispatch units with the same flat price curve segments proportionally to segment sizes. SCED Implementation: A small Δ price value is added at the end points of tie segments to create non-zero segment slope SCED Tie Breaking Properties: Both units will leave beginning points simultaneously Units will be dispatched within tie segments in proportion of tie segment sizes Both units will achieve segment end points simultaneously Impact on unit costs is neglectable (small Δ value)