  This paper proposes a global optimization method for it ensures finding good
solutions while solving the unit commitment (UC) problem with carbon emission
trading (CET). This method con-sists of two parts. In the first part, a
sequence of linear inte-ger-relaxed subproblems are first solved to rapidly
generate a tight linear relaxation of the original mixed integer nonlinear
pro-gramming problem (MINLP) model. In the second part, the algo-rithm
introduces the idea of center-cut so that it can quickly find good solutions.
The approach tested on 10 test instances with units ranging from 35 to 1560
over a scheduling period of 24h, and compared with state-of-the-art solver
CPLEX. The results show that the proposed algorithm can find better solutions
than CPLEX in a short time. And it is more suitable to solve large scale UC
problem than CPLEX.
