TY - JOUR
T1 - Evaluation of two lagrangian dual optimization algorithms for large-scale unit commitment problems
AU - Fan, Wen
AU - Liao, Yuan
AU - Lee, Jong Beom
AU - Kim, Yong Kab
PY - 2012/1
Y1 - 2012/1
N2 - Lagrangian relaxation is the most widely adopted method for solving unit commitment (UC) problems. It consists of two steps: dual optimization and primal feasible solution construction. The dual optimization step is crucial in determining the overall performance of the solution. This paper intends to evaluate two dual optimization methods - one based on subgradient (SG) and the other based on the cutting plane. Large-scale UC problems with hundreds of thousands of variables and constraints have been generated for evaluation purposes. It is found that the evaluated SG method yields very promising results.
AB - Lagrangian relaxation is the most widely adopted method for solving unit commitment (UC) problems. It consists of two steps: dual optimization and primal feasible solution construction. The dual optimization step is crucial in determining the overall performance of the solution. This paper intends to evaluate two dual optimization methods - one based on subgradient (SG) and the other based on the cutting plane. Large-scale UC problems with hundreds of thousands of variables and constraints have been generated for evaluation purposes. It is found that the evaluated SG method yields very promising results.
KW - Dual optimization
KW - Lagrangian relaxation
KW - Resource scheduling
KW - Unit commitment
UR - http://www.scopus.com/inward/record.url?scp=84863274411&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863274411&partnerID=8YFLogxK
U2 - 10.5370/JEET.2012.7.1.17
DO - 10.5370/JEET.2012.7.1.17
M3 - Article
AN - SCOPUS:84863274411
SN - 1975-0102
VL - 7
SP - 17
EP - 22
JO - Journal of Electrical Engineering and Technology
JF - Journal of Electrical Engineering and Technology
IS - 1
ER -