A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints

Journal article (2017)

Authors

C. Gentile Consiglio Nazionale Delle Ricerche
G.A. Morales Espana Algorithmics - EEMCS
A Ramos Comillas Pontifical University
Research Group
Algorithmics (EEMCS) (TU Delft)
Unit commitment (UC) Mixed-integer programming (MIP) Facet/convex hull description
More Info
expand_more

Published Date

2017

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Algorithmics

Abstract

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.