Convex Relaxations of the Short-Term Hydrothermal Scheduling Problem
Peer reviewed, Journal article
MetadataShow full item record
This paper concerns the assessment of two methods for convex relaxation of the short-term hydrothermal scheduling problem. The problem is originally formulated as a mixed integer programming problem, and then approximated using both Lagrangian and Linear relaxation. The two relaxation methods are quantitatively compared using a realistic data description of the Northern European power system, considering a set of representative days. We find that the Lagrangian relaxation approximates system operational costs in the range 55-81% closer to the mixed integer programming problem solution than the Linear relaxation. We show how these cost gaps vary with season and climatic conditions. Conversely, the differences in both marginal cost of electricity and reserve capacity provided by the Lagrangian and Linear relaxation are muted.