Skip to content
naulon
Not checkedNot checked for notices yet.

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

C. Gentile, G. Morales-España, A. Ramos

EURO Journal on Computational Optimization · 2017

doi:10.1007/s13675-016-0066-y (opens in a new tab)

We email you when a new notice or a question about this paper appears.

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.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.