This paper presents a mixed-integer linear programming (MILP) reformulation of the thermal unit commitment (UC) problem. The proposed formulation is simultaneously tight and compact. The tighter characteristic reduces the search space and themore compact characteristic increases the searching speed with which solvers explore that reduced space. Therefore, as a natural consequence, the proposed formulation significantly reduces the computational burden in comparison with analogous MILP-based UC formulations. We provide computational results comparing the proposed formulation with two others which have been recognized as computationally efficient in the literature. The experiments were carried out on 40 different power system mixes and sizes, running from 28 to 1870 generating units.
- Mixed-integer linear programming (MILP)
- Strong lower bounds
- Thermal units
- Unit commitment (UC)