Convex Relaxations of the Short-Term Hydrothermal Scheduling Problem

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, cons...