Applying Karush-Kuhn-Tucker (KKT) Optimality Conditions for Pricing Analysis in DAM under the proposed Future AS Introduction to concepts The simplified hypothetical DAM optimization problem is presented below. Simplifications: (i) (ii) (iii) (iv) (v) Transmission constraints, PTPs, block offers and bids are not considered A single AS product (generically called AS) is considered Load Resources are not considered Energy Offer and AS Offer are covering the entire MW range from LSL to HSL No constraints on how much AS can be awarded to a single resource (vi) πΆπ , πΆπ , πΆπ are the submitted bids ($/MWh) , energy offers ($/MWh), AS offers ($/MW) respectively. For simplicity, these bids and offers are considered to be constant for the entire MW bid or offered. Resource commitment not considered – all Resources considered to be online and only online AS and Energy Offers considered All AS Offers from Generation Resources are considered to be inclusive with respect to their EOC. Temporal constraints not modeled AS Self Arrangement set to zero Other simplifications compared to actual DAM …. (vii) (viii) (ix) (x) (xi) πΈπππππ¦π΅ππ πΈπππππ¦πππππ π΄ππππππ Optimization Problem Minimize objective (cost) function: πππππππ§π {ππππππ‘ππ£π} πππ πΈπππππ¦π΅ππ = πππππππ§π {− ∑ πΆπ × πππ πΈπππππ¦π΅πππ΄π€πππ π=1 π πΈπππππ¦πππππ + ∑ πΆπ π=1 × πππ πΈπππππ¦ππππππ΄π€πππ π +∑ π΄ππππππ πΆπ π=1 × ππππ΄ππ΄π€πππ } Subject to: Ignoring transmission constraints and focusing on power balance, AS procurement and Resource limit constraints, the set of constraints are given below: System wide constraints: a) Power Balance: (Shadow price = π) πππ π ∑ πππ πΈπππππ¦ππππππ΄π€πππ π=1 − ∑ πππ πΈπππππ¦π΅πππ΄π€πππ =0 π=1 b) AS Procurement: (Shadow price = π ∑ πΌ) ππππ΄ππ΄π€πππ − π΄ππ πππ’πππππππ‘ ≥ 0 π=1 Individual Energy Bid constraints: c) Energy Bid MW constraint for every energy bid π = 1,2,3 … πππ : (Shadow price = ππππ respectively) πΈπππππ¦π΅πππππ − πππ πΈπππππ¦π΅πππ΄π€πππ ≥0 Individual Resource constraints: Each Resource will have its own set of constraints to ensure awards are within bounds of its own upper (HSL/MPC) and low (LSL/LPC) limits. d) LSL Constraint for every modeled Generation Resource π = 1,2,3 … π: (Shadow price = πππΏππΏ ) πππ πΈπππππ¦ππππππ΄π€πππ − πΏππΏπ ≥ 0 e) HSL Constraint for every modeled Generation Resource π = 1,2,3 … π: (Shadow price = πππ»ππΏ ) π»ππΏπ − πππ πΈπππππ¦ππππππ΄π€πππ − ππππ΄ππ΄π€πππ ≥ 0 Analysis by Applying KKT optimality conditions: The objective and constraints are combined to form the Lagrange function: β = {ππππππ‘ππ£π − ∑ πβππππ€ππππππ × πΆπππ π‘πππππ‘π } π πππ β= π πΈπππππ¦π΅ππ {− ∑ πΆπ π=1 π × πππ +∑ πΈπππππ¦π΅πππ΄π€πππ πΈπππππ¦πππππ + ∑ πΆπ × πππ πΈπππππ¦ππππππ΄π€πππ π=1 π΄ππππππ πΆπ π=1 × ππππ΄ππ΄π€πππ } πππ π − π (∑ βπππ π=1 π − πΌ (∑ πΈπππππ¦ππππππ΄π€πππ − ∑ βπππ πΈπππππ¦π΅πππ΄π€πππ ) π=1 ππππ΄ππ΄π€πππ − π΄ππ πππ’πππππππ‘ ) π=1 πππ − ∑ ππππ (πΈπππππ¦π΅πππππ − πππ πΈπππππ¦π΅πππ΄π€πππ ) π=1 π − ∑ πππΏππΏ (πππ πΈπππππ¦ππππππ΄π€πππ − πΏππΏπ ) π=1 π − ∑ πππ»ππΏ (π»ππΏπ − πππ πΈπππππ¦ππππππ΄π€πππ − ππππ΄ππ΄π€πππ ) π=1 At optimal solution ∇β = 0 (optimality condition) i.e. the partial derivative of β with respect to each award (πππ πΈπππππ¦π΅πππ΄π€πππ , πππ πΈπππππ¦ππππππ΄π€πππ , ππππ΄ππ΄π€πππ ) will equate to zero at the optimal solution. Taking the partial derivative of β with respect to each award (πππ πΈπππππ¦π΅πππ΄π€πππ , πππ πΈπππππ¦ππππππ΄π€πππ , ππππ΄ππ΄π€πππ ) we get: πππ ∇βππ = 0 = π πΈπππππ¦π΅ππ πΈπππππ¦π΅πππ΄π€πππ × βπππ {− ∑ πΆπ π=1 π π΄ππππππ + ∑ πΆπ × βππππ΄ππ΄π€πππ } π=1 − π (∑ βπππ πΈπππππ¦ππππππ΄π€πππ π=1 − ∑ βπππ π=1 πΈπππππ¦π΅πππ΄π€πππ π=1 πππ π πΌ (∑ βππππ΄ππ΄π€πππ π=1 ) + ∑ ππππ (βπππ πΈπππππ¦π΅πππ΄π€πππ π=1 π − ∑ πππΏππΏ (βπππ πΈπππππ¦ππππππ΄π€πππ ) π=1 π + ∑ πππ»ππΏ (βπππ π=1 × βπππ πππ π − πΈπππππ¦πππππ + ∑ πΆπ πΈπππππ¦ππππππ΄π€πππ + βππππ΄ππ΄π€πππ ) ) ) πΈπππππ¦ππππππ΄π€πππ Rearranging the terms by βπππ f) πΈπππππ¦π΅πππ΄π€πππ , βπππ πΈπππππ¦ππππππ΄π€πππ , βππππ΄ππ΄π€πππ we get: For each energy bid π = 1,2,3, … πππ, the following equation holds true πΈπππππ¦π΅ππ πΆπ = π − ππππ If the energy bid i is marginal to the power balance constraint, then ππππ = 0 and the energy bid i sets the shadow price for the power balance constraint (System Lambda (π)) g) For each Resource energy offer π = 1,2,3, … π, the following equation holds true πΈπππππ¦πππππ πΆπ = π − πππ»ππΏ + πππΏππΏ If the energy offer i is marginal to the power balance constraint, then in most cases, πππ»ππΏ = 0, πππΏππΏ = 0 and the energy offer i sets the shadow price for the power balance constraint (System Lambda (π)) h) For each Resource AS offer π = 1,2,3, … π, the following equation holds true π΄ππππππ πΆπ = πΌ − πππ»ππΏ If the AS offer i is marginal to the AS procurement constraint, then in most cases, πππ»ππΏ = 0and the AS offer i sets the shadow price for the AS procurement constraint (typically referred to as the AS MCPC (πΌ)) Pricing Analysis Example: Let there be a Resource g whose capacity has been partly awarded energy and partly awarded AS such that the sum of the energy award and AS award equals Resource g HSL. In this case: πΈπππππ¦ππππππ΄π€πππ πππ π΄πππππππ΄π€πππ + πππ = π»ππΏπ The HSL constraint is binding, i.e. πππ»ππΏ > 0 The LSL constraint is not binding, i.e. πππΏππΏ = 0 And, πΈπππππ¦πππππ πΆπ π΄ππππππ πΆπ − (π + πππ»ππΏ ) = 0 − (πΌ + πππ»ππΏ ) = 0 Rearranging we get πΈπππππ¦πππππ π − πΆπ π΄ππππππ πΌ − πΆπ = πππ»ππΏ = πππ»ππΏ Equating the two equations we get πΈπππππ¦πππππ π − πΆπ π΄ππππππ = πΌ − πΆπ This demonstrates that at the optimal solution Resource g is indifferent to whether its capacity is used for energy or AS. This is because for each MW sold from the resource for energy or AS, the additional revenue from energy or AS, over submitted offer price, is the same. DAM Pricing Analysis Applying KKT Optimality Conditions– Future AS The simplified DAM optimization problem under the proposed Future Ancillary Service framework is presented below. Simplifications: (i) (ii) (iii) Transmission constraints, PTPs, block offers and bids are not considered Energy Offer are covering the entire MW range from LSL to HSL No constraints on how much AS can be awarded to a single resource but AS awards cannot exceed the MW amount in the AS Offer (iv) πΆπ , πΆπ , πΆπ , ππ‘π. are the submitted bids ($/MWh) , energy offers ($/MWh), RegUp offers ($/MW), etc. respectively. For simplicity, these bids and offers are considered to be constant for the entire MW bid or offered. Resource commitment not considered – all Resources considered to be online and only online AS and Energy Offers considered All AS Offers from Generation Resources are considered to be inclusive with respect to their EOC. Temporal constraints not modeled AS Self Arrangement set to zero Other simplifications compared to actual DAM …. (v) (vi) (vii) (viii) (ix) πΈπππππ¦π΅ππ πΈπππππ¦πππππ π πππππππππ Optimization Problem Minimize objective (cost) function: ππ πππ πππππππ§π πΈπππππ¦π΅ππ {− ∑ πΆπ π=1 ππ+πππ × πππ πΈπππππ¦π΅πππ΄π€πππ πΈπππππ¦πππππ + ∑ πΆπ × πππ πΈπππππ¦ππππππ΄π€πππ π=1 π πππππππππ π πππππ΄π€πππ πΆπ × πππ π=1 πππ+ππππ πΉπ π ππππππππ πΉπ π ππππ΄π€πππ ∑ πΆπ × πππ π=1 ππ+πππ π πππ·ππππππ π πππ·ππ΄π€πππ ∑ πΆπ × πππ π=1 ππ+πππ ππππ πΉπ π ππ·ππππππ ππΉπ πππππ ∑ πΆπ × ππππΉπ π ππ·ππ΄π€πππ + ∑ πΆπ π=1 π=1 ππ+πππ ππ+πππ +∑ + + + πΆπ 1πππππ + ∑ πΆπ ππ 1πππππ × ππππΆπ 1π΄π€πππ + ∑ πΆπ π=1 πππ+πππ+ππππ + ∑ × πππππ 1π΄π€πππ π=1 πππ πΉπΉπ 1πππππ πΆπ × ππππΉπΉπ 1π΄π€πππ π=1 πππ πΉπΉπ 2πππππ + ∑ πΆπ × ππππΉπΉπ 2π΄π€πππ π=1 πππ πΆπ 2πππππ + ∑ πΆπ π=1 × πππππΉπ π΄π€πππ ππ 2πππππ × ππππΆπ 2π΄π€πππ + ∑ πΆπ π=1 × πππππ 2π΄π€πππ } Subject to: Ignoring transmission constraints and focusing on power balance, AS procurement and Resource limit constraints, the set of constraints are given below: System wide constraints: π) a) Power Balance: (Shadow price = ππ πππ ∑ πππ πΈπππππ¦ππππππ΄π€πππ − ∑ πππ π=1 πΈπππππ¦π΅πππ΄π€πππ b) RegUp Procurement (including FRRS-Up): (Shadow price = ππ+πππ ∑ π=1 πππ π πππππ΄π€πππ πππ+ππππ +∑ πππ π=1 πππ+ππππ πππ₯πΉπ π πππ − ∑ πππ π=1 π=1 πππ π πππ·ππ΄π€πππ ππππ +∑ π=1 πΉπ π ππππ΄π€πππ ππππ πππ₯πΉπ π ππ·π − ∑ π=1 ∑ π½) ππΉπ π ππ·π ) ππππΉπ π ππ·ππ΄π€πππ ≥ 0 CR Procurement (CR1 & CR2): (Shadow price = ππ+πππ ≥0 ππππΉπ π ππ·ππ΄π€πππ − π πππ·ππ πππ’πππππππ‘ ≥ 0 e) FRRS-Dn maximum procurement limit: (Shadow price = f) − π πππππ πππ’πππππππ‘ ≥ 0 ππΉπ π πππ ) d) RegDn Procurement (including FRRS-Dn): (Shadow price = ππ+πππ πΌ) πΉπ π ππππ΄π€πππ c) FRRS-Up maximum procurement limit: (Shadow price = ∑ =0 π=1 πΎ) πππ ππππΆπ 1π΄π€πππ π=1 + ∑ ππππΆπ 2π΄π€πππ − πΆπ π πππ’πππππππ‘ ≥ 0 π=1 g) CR1 minimum procurement : (Shadow price = ππΆπ 1 ) ππ+πππ ∑ ππππΆπ 1π΄π€πππ − ππππΆπ 1 ≥ 0 π=1 πΏ) h) SR Procurement (SR1 & SR2): (Shadow price = ππ+πππ ∑ πππ πππππ 1π΄π€πππ + ∑ πππππ 2π΄π€πππ − ππ π πππ’πππππππ‘ ≥ 0 π=1 i) π=1 SR1 minimum procurement : (Shadow price = πππ 1 ) ππ+πππ ∑ πππππ 1π΄π€πππ − πππππ 1 ≥ 0 π=1 j) π) PFR+FFR1+FFR2 Procurement: (Shadow price = ππ+πππ ∑ πππ+πππ+ππππ πππππΉπ π΄π€πππ +π ×( ∑ π=1 πππ ππππΉπΉπ 1π΄π€πππ π=1 + ∑ ππππΉπΉπ 2π΄π€πππ ) π=1 − (ππΉπ π πππ’πππππππ‘ + π × πΉπΉπ π πππ’πππππππ‘) ≥ 0 k) FFR1+FFR2 Maximum procurement limit : (Shadow price = πππ+πππ+ππππ πππ₯πΉπΉπ − ∑ πππ ππππΉπΉπ 1π΄π€πππ π=1 l) ππΉπΉπ ) − ∑ ππππΉπΉπ 2π΄π€πππ ≥ 0 π=1 FFR1 Maximum procurement limit : (Shadow price = ππΉπΉπ 1 ) πππ+πππ+ππππ πππ₯πΉπΉπ 1 − ππππΉπΉπ 1π΄π€πππ ≥ 0 ∑ π=1 Individual Energy Bid constraints: m) Energy Bid MW constraint for every energy bid π = 1,2,3 … πππ : (Shadow price = ππππ respectively) πΈπππππ¦π΅πππππ − πππ πΈπππππ¦π΅πππ΄π€πππ ≥0 Individual Resource constraints: Each Resource will have its own set of constraints to ensure awards are within bounds of its own upper (HSL/MPC) and low (LSL/LPC) limits. n) LSL Constraint for every modeled Generation Resource π = 1,2,3 … ππ : (Shadow price = πππΏππΏ ) πππ πΈπππππ¦ππππππ΄π€πππ − πππ π πππ·ππ΄π€πππ − πΏππΏπ ≥ 0 o) HSL Constraint for every modeled Generation Resource π = 1,2,3 … ππ : (Shadow price = πππ»ππΏ ) π»ππΏπ − πππ πΈπππππ¦ππππππ΄π€πππ − πππ π πππππ΄π€πππ − πππππΉπ π΄π€πππ − ππππΆπ 1π΄π€πππ − πππππ 1π΄π€πππ ≥0 p) AS Offer MW constraint for every modeled Generation Resource π = 1,2,3 … ππ : (Shadow price π−π΄ππ’π = ππ π−π΄πππ , ππ respectively) π΄πππππππππ − πππ π πππππ΄π€πππ − πππππΉπ π΄π€πππ − ππππΆπ 1π΄π€πππ − πππππ 1π΄π€πππ ≥ 0 π΄πππππππππ − πππ π πππ·ππ΄π€πππ ≥0 q) MPC & LPC Constraint for every modeled “Blocky” Load Resource π = 1,2,3 … πππ : (Shadow price = ππππ ) Note that a “blocky” Load Resource is awarded only one AS product. πππΆπ − πΏππΆπ − ππππΉπΉπ 1π΄π€πππ ≥ 0 or πππΆπ − πΏππΆπ − ππππΉπΉπ 2π΄π€πππ ≥ 0 or πππΆπ − πΏππΆπ − ππππΆπ 2π΄π€πππ ≥ 0 or πππΆπ − πΏππΆπ − πππππ 2π΄π€πππ ≥ 0 r) AS Offer MW constraint for every modeled “Blocky” Load Resource π = 1,2,3 … πππ : (Shadow price = ππππ−π΄π ) π΄πππππππππ − ππππΉπΉπ 1π΄π€πππ ≥ 0 or π΄πππππππππ − ππππΉπΉπ 2π΄π€πππ ≥ 0 or π΄πππππππππ − ππππΆπ 2π΄π€πππ ≥ 0 or π΄πππππππππ − πππππ 2π΄π€πππ ≥ 0 s) MPC & LPC Constraint for every modeled Controllable Load Resource π = 1,2,3 … πππ : (Shadow price = ππππ ) πππΆπ − πΏππΆπ − πππ ≥0 π πππ·ππ΄π€πππ − πππ π πππππ΄π€πππ − πππππΉπ π΄π€πππ − ππππΆπ 1π΄π€πππ − πππππ 1π΄π€πππ t) AS Offer MW constraint for every Controllable Load Resource π = 1,2,3 … πππ : (Shadow price = ππ−π΄ππ’π ππ , ππππ−π΄πππ respectively) π΄πππππππππ − πππ π πππππ΄π€πππ − πππππΉπ π΄π€πππ − ππππΆπ 1π΄π€πππ − πππππ 1π΄π€πππ ≥ 0 π΄πππππππππ − πππ π πππ·ππ΄π€πππ ≥0 u) HSL & LSL Constraint for every “Quick/Fast” Resource qualified for FRRS-Up and FFR1 and partly ππ modeled as Generation Resource π = 1,2,3 … πππ : (Shadow price = ππ ) π»ππΏπ − πΏππΏπ − πππ πΉπ π ππππ΄π€πππ − ππππΉπΉπ 1π΄π€πππ ≥ 0 v) AS Offer MW constraint for every “Quick/Fast” Resource qualified for FRRS-Up and FFR1 and ππ−π΄π partly modeled as Generation Resource π = 1,2,3 … πππ : (Shadow price = ππ π΄πππππππππ − πππ πΉπ π ππππ΄π€πππ ) − ππππΉπΉπ 1π΄π€πππ ≥ 0 w) MPC & LPC Constraint for every “Quick/Fast” Resource qualified for FRRS-Up, FRRS-Dn and FFR1 πππ and partly modeled as Controllable Load Resource π = 1,2,3 … ππππ : (Shadow price = ππ ) πππΆπ − πΏππΆπ − ππππΉπ π ππ·ππ΄π€πππ − πππ πΉπ π ππππ΄π€πππ − ππππΉπΉπ 1π΄π€πππ ≥ 0 x) AS Offer MW constraint for every “Quick/Fast” Resource qualified for FRRS-Up and FFR1 and partly modeled as Controllable Load Resource π = 1,2,3 … ππππ : (Shadow price = πππ−π΄ππ’π ππ πππ−π΄πππ , ππ respectively) π΄πππππππππ − πππ πΉπ π ππππ΄π€πππ − ππππΉπΉπ 1π΄π€πππ ≥ 0 π΄πππππππππ − ππππΉπ π ππ·ππ΄π€πππ ≥ 0 Pricing Analysis By Applying KKT optimality conditions: The objective and constraints are combined to form the Lagrange function: β = {ππππππ‘ππ£π − ∑ πβππππ€ππππππ × πΆπππ π‘πππππ‘π } π At optimal solution ∇β = 0 (KKT optimality condition) i.e. the partial derivative of β with respect to each award πΈπππππ¦π΅πππ΄π€πππ (πππ solution. , πππ πΈπππππ¦ππππππ΄π€πππ , πππ π πππππ΄π€πππ , ππ‘π) will equate to zero at the optimal Taking the partial derivative of β with respect to each award (πππ πΈπππππ¦π΅πππ΄π€πππ , πππ πΈπππππ¦ππππππ΄π€πππ , πππ π πππππ΄π€πππ , ππ‘π. ) results in: πππ ∇βππ = 0 = πΈπππππ¦π΅ππ × βπππ πΈπππππ¦πππππ × βπππ {− ∑ πΆπ πΈπππππ¦π΅πππ΄π€πππ π=1 { ππ + ∑ πΆπ πΈπππππ¦ππππππ΄π€πππ π=1 ππ+πππ +∑ π πππππππππ πΆπ π=1 πππ+ππππ +∑ πΉπ π ππππππππ πΆπ π=1 ππ+πππ +∑ π πππ·ππππππ πΆπ π=1 ππππ +∑ π=1 × βπππ π πππππ΄π€πππ × βπππ × βπππ πΉπ π ππππ΄π€πππ π πππ·ππ΄π€πππ ππ+πππ πΉπ π ππ·ππππππ πΆπ × βππππΉπ π ππ·ππ΄π€πππ × βπππππΉπ π΄π€πππ π=1 ππ+πππ ππ+πππ πΆπ 1πππππ + ∑ πΆπ ππ 1πππππ × βππππΆπ 1π΄π€πππ + ∑ πΆπ π=1 πππ+πππ+ππππ + ππΉπ πππππ + ∑ πΆπ π=1 πππ πΉπΉπ 1πππππ πΆπ ∑ × βπππππ 1π΄π€πππ × βππππΉπΉπ 1π΄π€πππ πΉπΉπ 2πππππ + ∑ πΆπ π=1 × βππππΉπΉπ 2π΄π€πππ π=1 πππ πππ πΆπ 2πππππ + ∑ πΆπ ππ 2πππππ × βππππΆπ 2π΄π€πππ + ∑ πΆπ π=1 × βπππππ 2π΄π€πππ } π=1 ππ πππ − π (∑ βπππ πΈπππππ¦ππππππ΄π€πππ − ∑ βπππ π=1 ππ+πππ π=1 ππ+πππ π=1 ππ+πππ βπππ π πππππ΄π€πππ βπππ π πππ·ππ΄π€πππ πππ+ππππ +∑ π=1 ππππ +∑ π=1 βπππ πππ π=1 π=1 ππ+πππ π=1 πππ βπππππ 1π΄π€πππ + ∑ βπππππ 2π΄π€πππ ) π=1 ππ+πππ − π ( ∑ βπππππΉπ π΄π€πππ + π π=1 πΉπ π ππππ΄π€πππ βππππΉπ π ππ·ππ΄π€πππ ) − πΎ ( ∑ βππππΆπ 1π΄π€πππ + ∑ βππππΆπ 2π΄π€πππ ) −πΏ( ∑ ) π=1 − πΌ (∑ − π½ (∑ πΈπππππ¦π΅πππ΄π€πππ ) πππ+πππ+ππππ ×( πππ βππππΉπΉπ 1π΄π€πππ ∑ + ∑ βππππΉπΉπ 2π΄π€πππ )) π=1 π=1 πππ+ππππ + ππΉπ π πππ (∑ βπππ π=1 ππ+πππ − ππΆπ 1 ( ∑ πΉπ π ππππ΄π€πππ ππππ ) + ππΉπ π ππ·π (∑ πππ 1 ( ∑ βπππππ 1π΄π€πππ ) π=1 πππ+πππ+ππππ πππ ∑ βππππΉπΉπ 1π΄π€πππ + ∑ βππππΉπΉπ 2π΄π€πππ ) π=1 π=1 + ππΉπΉπ ( πππ+πππ+ππππ + ππΉπΉπ 1 ( ∑ βππππΉπΉπ 1π΄π€πππ ) + ∑ π=1 ππ π=1 ππ + + + + + + + + + + + + πππΏππΏ (βπππ πΈπππππ¦ππππππ΄π€πππ − βπππ πππ π=1 ππππ (βπππ π πππ·ππ΄π€πππ πΈπππππ¦π΅πππ΄π€πππ ) ) πΈπππππ¦ππππππ΄π€πππ π πππππ΄π€πππ πππ»ππΏ (βπππ + βπππ + βπππππΉπ π΄π€πππ π=1 βππππΆπ 1π΄π€πππ + βπππππ 1π΄π€πππ ) ππ π−π΄ππ’π π πππππ΄π€πππ ∑ ππ + βπππππΉπ π΄π€πππ + βππππΆπ 1π΄π€πππ (βπππ π=1 ππ π−π΄πππ π πππ·ππ΄π€πππ βπππππ 1π΄π€πππ ) + ∑ ππ (βπππ ) π=1 πππ ∑ ππππ (βππππΉπΉπ 1π΄π€πππ ππ πΉπΉπ 2π΄π€πππ ππ πΆπ 2π΄π€πππ ππ ππ 2π΄π€πππ ) π=1 πππ ∑ ππππ−π΄π (βππππΉπΉπ 1π΄π€πππ ππ πΉπΉπ 2π΄π€πππ ππ πΆπ 2π΄π€πππ ππ ππ 2π΄π€πππ ) π=1 πππ π πππ·ππ΄π€πππ π πππππ΄π€πππ ∑ ππππ (βπππ + βπππ + βπππππΉπ π΄π€πππ + βππππΆπ 1π΄π€πππ π=1 βπππππ 1π΄π€πππ ) πππ ππ−π΄ππ’π π πππππ΄π€πππ ∑ ππ + βπππππΉπ π΄π€πππ + βππππΆπ 1π΄π€πππ (βπππ π=1 πππ π πππ·ππ΄π€πππ βπππππ 1π΄π€πππ ) + ∑ ππππ−π΄πππ (βπππ ) π=1 πππ ππ πΉπ π ππππ΄π€πππ ∑ ππ (βπππ + βππππΉπΉπ 1π΄π€πππ ) π=1 πππ ππ−π΄π πΉπ π ππππ΄π€πππ ∑ ππ + βππππΉπΉπ 1π΄π€πππ ) (βπππ π=1 ππππ πππ πΉπ π ππππ΄π€πππ ∑ ππ (βππππΉπ π ππ·ππ΄π€πππ + βπππ + βππππΉπΉπ 1π΄π€πππ ) π=1 ππππ πππ−π΄ππ’π πΉπ π ππππ΄π€πππ ∑ ππ + βππππΉπΉπ 1π΄π€πππ ) (βπππ π=1 +∑ + βππππΉπ π ππ·ππ΄π€πππ ) ππ+πππ βππππΆπ 1π΄π€πππ ) − π=1 −∑ π=1 ππππ +∑ πππ−π΄πππ ππ π=1 (βππππΉπ π ππ·ππ΄π€πππ ) } Rearranging the terms by βπππ πΈπππππ¦π΅πππ΄π€πππ , βπππ πΈπππππ¦ππππππ΄π€πππ , βπππ π πππππ΄π€πππ , ππ‘π. we get: a) For each energy bid π = 1,2,3, … πππ, the following equation holds true πΈπππππ¦π΅ππ πΆπ = π − ππππ b) For each energy offer from modeled Generation Resource π = 1,2,3, … ππ , the following equation holds true πΈπππππ¦πππππ πΆπ = π − πππ»ππΏ + πππΏππΏ c) For each RegUp offer from modeled Generation Resource π = 1,2,3, … ππ , the following equation holds true π πππππππππ πΆπ π−π΄ππ’π = πΌ − πππ»ππΏ − ππ d) For each RegDn offer from modeled Generation Resource π = 1,2,3, … ππ , the following equation holds true π πππ·ππππππ πΆπ π−π΄πππ = π½ − πππΏππΏ − ππ e) For each PFR offer from modeled Generation Resource π = 1,2,3, … ππ , the following equation holds true ππΉπ πππππ πΆπ f) π−π΄ππ’π = π − πππ»ππΏ − ππ For each CR1 offer from modeled Generation Resource π = 1,2,3, … ππ , the following equation holds true πΆπ 1πππππ πΆπ π−π΄ππ’π = πΎ + ππΆπ 1 − πππ»ππΏ − ππ g) For each SR1 offer from modeled Generation Resource π = 1,2,3, … ππ , the following equation holds true ππ 1πππππ πΆπ π−π΄ππ’π = πΏ + πππ 1 − πππ»ππΏ − ππ h) For each FFR1 offer from modeled “blocky” Load Resource π = 1,2,3, … πππ , the following equation holds true πΉπΉπ 1πππππ πΆπ i) = π π − ππΉπΉπ − ππΉπΉπ 1 − ππππ − ππππ−π΄π For each FFR2 offer from modeled “blocky” Load Resource π = 1,2,3, … πππ , the following equation holds true πΉπΉπ 2πππππ πΆπ j) = π π − ππΉπΉπ − ππππ − ππππ−π΄π For each CR2 offer from modeled “blocky” Load Resource π = 1,2,3, … πππ , the following equation holds true πΆπ 2πππππ πΆπ = πΎ − ππππ − ππππ−π΄π k) For each SR2 offer from modeled “blocky” Load Resource π = 1,2,3, … πππ , the following equation holds true ππ 2πππππ πΆπ l) = πΏ − ππππ − ππππ−π΄π For each RegUp offer from modeled Controllable Load Resource π = 1,2,3, … πππ , the following equation holds true π πππππππππ πΆπ ππ−π΄ππ’π = πΌ − ππππ − ππ m) For each RegDn offer from modeled Controllable Load Resource π = 1,2,3, … πππ , the following equation holds true π πππ·ππππππ πΆπ = π½ − ππππ − ππππ−π΄πππ n) For each PFR offer from modeled Controllable Load Resource π = 1,2,3, … πππ , the following equation holds true ππΉπ πππππ πΆπ ππ−π΄ππ’π = π − ππππ − ππ o) For each CR1 offer from modeled Controllable Load Resource π = 1,2,3, … πππ , the following equation holds true πΆπ 1πππππ πΆπ ππ−π΄ππ’π = πΎ + ππΆπ 1 − ππππ − ππ p) For each SR1 offer from modeled Controllable Load Resource π = 1,2,3, … πππ , the following equation holds true ππ 1πππππ πΆπ ππ−π΄ππ’π = πΏ + πππ 1 − ππππ − ππ q) For each FRRS-Up offer from “Quick/Fast” Resource partly modeled as Generation Resource π = 1,2,3, … πππ , the following equation holds true πΉπ π ππππππππ πΆπ ππ ππ−π΄π = πΌ − ππΉπ π πππ − ππ − ππ r) For each FFR1 offer from “Quick/Fast” Resource partly modeled as Generation Resource π = 1,2,3, … πππ , the following equation holds true πΉπΉπ 1πππππ πΆπ ππ = π π − ππΉπΉπ − ππΉπΉπ 1 − ππ ππ−π΄π − ππ s) For each FRRS-Up offer from “Quick/Fast” Resource partly modeled as Load Resource π = 1,2,3, … ππππ , the following equation holds true πΉπ π ππππππππ πΆπ πππ = πΌ − ππΉπ π πππ − ππ πππ−π΄ππ’π − ππ t) For each FRRS-Dn offer from “Quick/Fast” Resource partly modeled as Load Resource π = 1,2,3, … ππππ , the following equation holds true πΉπ π ππ·ππππππ πΆπ πππ = π½ − ππΉπ π ππ·π − ππ πππ−π΄πππ − ππ u) For each FFR1 offer from “Quick/Fast” Resource partly modeled as Load Resource π = 1,2,3, … ππππ , the following equation holds true πΉπΉπ 1πππππ πΆπ πππ = π π − ππΉπΉπ − ππΉπΉπ 1 − ππ πππ−π΄ππ’π − ππ MCPC for proposed Future Ancillary Service MCPC for a given AS is computed after the DAM optimization is complete. MCPCs are a linear combination of Shadow Prices of constraints. In the current Nodal Market, the MCPCs are setup to be the Shadow Price of a single constraint (procurement constraint of the respective AS). 1. In the current ERCOT market, all demand (load) is bought at the Load Zone (except for Wholesale Load). Load Resources cannot submit Resource Specific (locational) demand bids (bid to buy energy). Load Resources can only submit Resource specific Offers to sell Ancillary Services. 2. Hence, the Load Resource Limit Constraints do not have an energy consumed portion between their lower and upper limits. 3. Generation Resources, however, can submit Resource specific Offers to sell energy and Ancillary Services. 4. Due to the above two features of our market design, in the DAM optimization: a. For Generation Resources, the energy and AS co-optimization process allocates the offered MW capacity (constrained between LSL and HSL) between energy and Ancillary Services taking into account opportunity costs for energy and Ancillary Services. i.e. the prices (LMP-energy and MCPC-AS) incorporate opportunity costs b. For Load Resources, as there is no energy component (demand), the energy and AS cooptimization process only allocates the offered MW capacity considering only AS offer(s) 5. If AS offers from Load Resources were cleared against the AS requirement from Load Resources, as there is no consideration of energy, then the corresponding AS MCPC will be determined solely by the marginal AS Offer from Load Resources – there is no opportunity cost for energy incorporated. In the current ERCOT Nodal Market, 1. Load Resources are allowed to offer into any and all AS products. 2. AS Offers from Load Resources are cleared together with AS Offers from Generation Resources and thus, 3. The resultant MCPC reflects any opportunity costs for energy and other Ancillary Services. This decision was there even in the Zonal Market for RRS and seems to reflect a policy decision made by the stakeholders. 4. The equivalency ratio between MW offered for AS from Load Resources and MW offered for the same AS from Generation Resources is one (RAS = 1). For the proposed future Ancillary Service product set, the same concepts (policy decisions) have been carried forth based on discussion at the FAST meetings, 1. PFR and FFR procurement is governed primarily by the constraint that incorporates the equivalency ratio R between PFR and FFR a. This is similar to the way RRS is currently cleared if we consider R=1 b. Due to the equivalency ratio R, the MCPCRRS-LR for FFFR must reflect this ratio. Note: if in the current RRS, if there was a decision to incorporate the ratio R (which comes from reliability studies), then the MCPC for RRS from Load Resources must be R*MCPCRRS-Gen 2. Similarly for CR (CR1&CR2) and SR (SR1&SR2), the CR and SR Offers from Generation Resource and Load Resource are cleared together to meet the total CR and SR requirement respectively. This is done to allow for substitution between the AS offers from Generation and Load Resources. AS Product PFR MCPC FFR1 ππππππ’π (π × π, πππΏπΏ) π FFR2 ππππππ’π (π × π, πππΏπΏ) CR1 πΎ + ππΆπ 1 CR2 πΎ + ππΆπ 1 SR1 πΏ + πππ 1 SR2 πΏ + πππ 1 RegUp πΌ FRRS-Up RegDn πΌ π½ FRRS-Dn π½ Comments Shadow Price of the PFR+FFR1+FFR2 procurement constraint R (equivalencing ratio of PFR to FFR) multiplied by the Shadow price of the PFR_FFR1+FFR2 procurement constraint. This FFR2 MCPC is capped at VOLL R (equivalencing ratio of PFR to FFR) multiplied by the Shadow price of the PFR+FFR1+FFR2 procurement constraint. This FFR1 MCPC is capped at VOLL Sum of the Shadow Prices of the CR (CR1+CR2) procurement constraint (πΎ)and the CR1 minimum procurement constraint (ππΆπ 1) CR2 is valued the same as CR1. The Shadow Price ππΆπ 1 if non- zero encapsulates any opportunity cost for energy and other Ancillary Service. Sum of the Shadow Prices of the SR (SR1+SR2) procurement constraint (πΏ) and the SR1 minimum procurement constraint (πππ 1 ) SR2 is valued the same as SR1. The Shadow Price πππ 1 if non- zero encapsulates any opportunity cost for energy and other Ancillary Service. Shadow price of the RegUp procurement (including FRRS-Up) constraint FRRS-Up is valued the same as RegUp Shadow price of the RegDn procurement (including FRRS-Dn) constraint FRRS-Down is valued the same as RegDn