A Performance Review of Lagrangian Relaxation Method for Unit Commitment in Korean Electricity Market

Author

Hur, Don ; Jeong, Hae Seong ; Lee, Heung Jae

Author_Institution

Dept. of Electr. Eng., Kwangwoon Univ., Seoul

fYear

2007

Firstpage

2184

Lastpage

2188

Abstract

In 2001, AREVA´s optimization solution, Resource Scheduling and Commitment (RSC), was launched to solve the unit commitment problem in Korean electricity market. At this stage we are making a full review of it, tacking benefits of the recent advances in the operational research field. To begin with, the features of Korean electricity market are briefly described and then many of the inherent problems associated with Lagrangian Relaxation (LR) algorithms are ferreted out through stark contrast with the robust and flexible Mixed Integer Programming (MIP) formulation.

Keywords

integer programming; power generation scheduling; power markets; relaxation theory; Korean electricity market; Lagrangian relaxation method; flexible mixed integer programming; resource commitment; resource scheduling; unit commitment problem; Business; Electricity supply industry; Job shop scheduling; Lagrangian functions; Law; Legal factors; Linear programming; Monopoly; Power generation; Relaxation methods; Economic dispatch; Korean electricity market; Lagrangian relaxation; Mixed integer programming; Unit commitment;

fLanguage

English

Publisher

ieee

Conference_Titel

Power Tech, 2007 IEEE Lausanne

Conference_Location

Lausanne

Print_ISBN

978-1-4244-2189-3

Electronic_ISBN

978-1-4244-2190-9

Type

conf

DOI

10.1109/PCT.2007.4538657

Filename

4538657