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.

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

Gentile C;
2017

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.
2017
Istituto di Analisi dei Sistemi ed Informatica ''Antonio Ruberti'' - IASI
Unit commitment (UC) Mixed-integer programming (MIP) Facet/convex hull description
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/333410
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 52
  • ???jsp.display-item.citation.isi??? ND
social impact