Deterministic optimization of the thermal Unit Commitment problem: A Branch and Cut search

This paper proposes a novel deterministic optimization approach for the Unit Commitment (UC) problem, involving thermal generating units. A mathematical programming model is first presented, whichincludes all the basic constraints and a set of binary variables for the on/off status of each generator...

Full description

Bibliographic Details
Main Author: Marcovecchio, Marian G. (author)
Other Authors: Novais, Augusto Q. (author), Grossmann, Ignacio E. (author)
Format: article
Language:eng
Published: 2014
Subjects:
Online Access:http://hdl.handle.net/10400.9/2552
Country:Portugal
Oai:oai:repositorio.lneg.pt:10400.9/2552
Description
Summary:This paper proposes a novel deterministic optimization approach for the Unit Commitment (UC) problem, involving thermal generating units. A mathematical programming model is first presented, whichincludes all the basic constraints and a set of binary variables for the on/off status of each generator ateach time period, leading to a convex mixed-integer quadratic programming (MIQP) formulation. Then,an effective solution methodology based on valid integer cutting planes is proposed, and implementedthrough a Branch and Cut search for finding the global optimal solution. The application of the pro-posed approach is illustrated with several examples of different dimensions. Comparisons with other mathematical formulations are also presented.