Random feasible directions algorithm with a generalized Lagrangian relaxation algorithm for solving unit commitment problem

2015 ◽  
Vol 38 (5) ◽  
pp. 547-561 ◽  
Author(s):  
Ming-Tse Kuo ◽  
Shiue-Der Lu
Keyword(s):  
Lagrangian Relaxation ◽  
Unit Commitment ◽  
Unit Commitment Problem ◽  
Feasible Directions ◽  
Relaxation Algorithm ◽  
Generalized Lagrangian ◽  
Commitment Problem ◽  
Lagrangian Relaxation Algorithm

Non-Linear Pricing in Transmission Constrained Electricity Markets: A Congestion Rents Application

2004 ◽  
Vol 1 (2) ◽  
Author(s):  
Jeovani E Santiago ◽  
Marcelino M Martinez
Keyword(s):  
Lagrangian Relaxation ◽  
Electricity Markets ◽  
Unit Commitment ◽  
Unit Commitment Problem ◽  
Single Node ◽  
Coordination Algorithms ◽  
Non Linear ◽  
Commitment Problem ◽  
Lagrangian Relaxation Algorithm ◽  
Transmission Rights

Based on recent research of non-linear pricing for single-node unit commitment models, this paper proposes a transmission constrained non-linear pricing alternative based coordination functions added to the classic decomposition Lagrangian relaxation algorithm to solve transmission constrained unit commitment models. The new coordination algorithms finds agent’s purchase and sell prices that coordinate the market in the absence of classic equilibrium. Since non-linear prices differ for each agent connected to a transmission node, the value of the congestion rents are redefined so that the new pricing mechanism is taken in to account. The redefinition of congestion rents is necessary so that the implementation of financial transmission rights, in their varied forms, is still possible in order to provide a price hedging mechanism in the nodal spot market.In this study, we propose a solution of unit commitment problem with network constraints and FTR´s using non-linear prices. The proposes prices have been applied to IEEE 14 and 30 test systems with 20 and 35 generators for a single period. The result shows that the proposed prices are capable to obtain satisfactory schedules without any interest conflicts.

Implementation of a Lagrangian Relaxation Based Unit Commitment Problem

1989 ◽  
Vol 9 (11) ◽  
pp. 34-34 ◽  
Author(s):  
Sudhir Virmani ◽  
Eugene C. Adrian ◽  
Karl Imhof ◽  
Shishir Mukherjee
Keyword(s):  
Lagrangian Relaxation ◽  
Unit Commitment ◽  
Unit Commitment Problem ◽  
Commitment Problem
Sign in / Sign up

Export Citation Format

Share Document