A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
Journal Article
(2017)
Research Group
Algorithmics
DOI related publication
https://doi.org/10.1007/s13675-016-0066-y
To reference this document use:
https://resolver.tudelft.nl/uuid:c68445a0-9acf-46b1-b77f-99bc05025070
More Info
expand_more
expand_more
Publication Year
2017
Language
English
Research Group
Algorithmics
Issue number
1-2
Volume number
5
Pages (from-to)
177-201
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.
No files available
Metadata only record. There are no files for this record.