Module E3-b Economic Dispatch (continued).

Slides:



Advertisements
Similar presentations
Linear Programming Sensitivity Analysis How will a change in a coefficient of the objective function affect the optimal solution? How will a change in.
Advertisements

LECTURE 14 Minimization Two Phase method by Dr. Arshad zaheer
Separating Hyperplanes
EE 553 Introduction to Optimization
Support Vector Machines
Economics 214 Lecture 37 Constrained Optimization.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
8.3 Linear Inequalities in Two Variables BobsMathClass.Com Copyright © 2010 All Rights Reserved. 1 4.The next step is to determine which side of the line.
1 Least Cost System Operation: Economic Dispatch 2 Smith College, EGR 325 March 10, 2006.
11. Cost minimization Econ 494 Spring 2013.
Section 2.4 solving equations with variables on both sides of the equal sign. Day 1.
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to two  constraints.
Solving Quadratic Equations – Part 1 Methods for solving quadratic equations : 1. Taking the square root of both sides ( simple equations ) 2. Factoring.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Example: 3x 2 + 9x + 6. Solving Quadratic Equations.
4  The Simplex Method: Standard Maximization Problems  The Simplex Method: Standard Minimization Problems  The Simplex Method: Nonstandard Problems.
Solving Inequalities Addition and Subtraction. Module 3, Lesson 3 Online Algebra
“Teach A Level Maths” Vol. 1: AS Core Modules
L8 Optimal Design concepts pt D
Applications of Log Rules. We are just substituting in for each expression!
Dear Power point User, This power point will be best viewed as a slideshow. At the top of the page click on slideshow, then click from the beginning.
Optimization and Lagrangian. Partial Derivative Concept Consider a demand function dependent of both price and advertising Q = f(P,A) Analyzing a multivariate.
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
Quadratic Inequalities You can solve a quadratic inequality algebraically by factoring. Just like solving a quadratic equality we set it = to 0. we move.
Economics 2301 Lecture 37 Constrained Optimization.
Difference between Expression and Equation?. L.O. To be able to solve Quadratic Equations There are several ways to solve a quadratic equation Factorising.
Example 31: Solve the following game by equal gains method: Y I II I II I X II II
Aim: How do we solve rational inequalities? Do Now: 2. Find the value of x for which the fraction is undefined 3. Solve for x: HW: p.73 # 4,6,8,10,14.
Solving Quadratic Equations. Find the quadratic equation if the solutions are 3 and -2. x = 3 x = -2 Make them equal zero. x – 3 = 0x + 2 = 0 (x – 3)(x.
What is the difference between > and
Section 5.3 “Solving Eq. And Ineq. w/ Absolute Value”
MIT and James Orlin © The Geometry of Linear Programs –the geometry of LPs illustrated on GTC.
Linear Equations / Inequalities – graphing the solution set
An Introduction to Linear Programming
Digital Lesson Linear Programming.
Chap 10. Sensitivity Analysis
Digital Lesson Linear Programming.
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
Sec 5.3 – Undetermined Coefficients
LMP calculations Congestion evaluation
Module E3-a Economic Dispatch.
Constrained Optimization
CS5321 Numerical Optimization
ECEN 460 Power System Operation and Control
Solving Quadratic Equations by Factoring
Constrained Optimization
Constrained Optimization – Part 1
PRELIMINARY MATHEMATICS
Chapter 5. The Duality Theorem
Outline Unconstrained Optimization Functions of One Variable
Systems Analysis Methods
Solving absolute value equations visually
Notes Over 1.7 Solving Inequalities
How do we solve quadratic inequalities?
Notes Over 1.7 Solving Inequalities
Constrained Optimization – Part 1
Part 3. Linear Programming
1.8 Matrices.
Constrained Optimization
1.8 Matrices.
3(9z + 4) > 35z – 4 Original problem. Solve each inequality. Then graph the solution set on the number line. 3(9z + 4) > 35z – 4 Original problem.
Prepared by Po-Chuan on 2016/05/24
QUESTION 9 The given inequality is
EE/Econ 458 Introduction to Optimization
Constraints.
EE/Econ 458 Introduction to Economics: Producer’s Surplus
Presentation transcript:

Module E3-b Economic Dispatch (continued)

Continuing from the previous two gen example, let’s consider what happens if the demand is increased from PT=400 MW to PT= 550 MW. First, we need to solve it with only equality constraints. The LaGrangian function is:

KKT conditions are

P1 is within limits, but P2 exceeds its 200 MW upper limit. So…...

Constraint associated with the complementarity cdt: is binding: P2-200=0 (an equality constraint! ==> P2=200.) Therefore the mu2 multiplier will not be zero (but all other mu multipliers will still be zero, since the corresponding inside term will NOT be zero).

So the new LaGrangian function is:

KKT conditions become

Rewrite the equations in preparation for putting into matrix form.

All constraints are satisfied therefore this is the solution.

What is the meaning of mu? Recall that we interpreted lambda as the cost of “increasing” the RHS of the equality constraint by 1 MW for an hour. Let’s see if mu is the cost of increasing the RHS of the corresponding inequality constraint by 1 MW for an hour. So let’s let the upper bound of P2 be 201 MW.

Get total cost corresponding to P2max=200.

Refer back to our solution without any inequality constraints. We obtained And this also violates P2max<201 MW. So we can use the set-up we already developed for bringing in this constraint, except we simply change from 200 to 201.

Get total costs corresponding to this solution.

The total costs changed from Which is almost the same as the mu2 multiplier. Implication is that if we increase P2max to 201 MW, we can save $3.34

A fundamental EDC concept: Consider the first KKT condition: If all gens are regulating, then IC1 = IC2 = … = ICi = lambda

At the optimal (min cost) solution, all regulating generators (those not at their limits) will have the same incremental cost, IC=dC/dP which will be lambda.

This gives rise to the graphical solution method.