This paper provides the convex hull description of the single thermal Unit
Commitment (UC) problem with the following basic operating constraints: (1) generation limits, (2) start-up and shut-down capabilities, and (3) minimum up and down times. The proposed constraints can be used as the core of any unit commitment formulation to strengthen the lower bound in enumerative approaches.We provide evidence that dramatic improvements in computational time are obtained by solving the self-UC problem and the network-constrained UC problem with the new inequalities for different case studies.
Original languageEnglish
Pages (from-to)177-201
Number of pages24
JournalEURO Journal on Computational Optimization
Issue number1-2
Publication statusPublished - 2017

    Research areas

  • Unit commitment (UC), Mixed-integer programming (MIP), Facet/convex hull description

ID: 24868877