Alternative formulations for unit commitment

Author

Xitan Qiang ; Boran Zhou ; Quanyuan Jiang

Author_Institution

Sch. of Electr. Eng., Zhejiang Univ., Hangzhou, China

fYear

2012

fDate

18-20 Sept. 2012

Firstpage

1

Lastpage

6

Abstract

The short-term unit commitment (UC) problem in thermal power generation is a large-scale, mixed-integer nonlinear programming problem, which is difficult to be solved efficiently. It is possible to approximate the non-linear objective by means of piece-wise linear functions, so that UC can be approximated by a mixed-integer linear programming (MILP). This paper presents tighter constraints for the formulation to solve the thermal unit commitment (UC) problems, which is more computationally efficient. Results based on realistic studies support this conclusion.

Keywords

integer programming; linear programming; nonlinear programming; power generation dispatch; thermal power stations; MILP; UC problem; linear function; mixed-integer linear programming; mixed-integer nonlinear programming problem; short-term unit commitment problem; thermal power generation; thermal unit commitment problem; Convergence; Generators; Linear programming; Optimization; Piecewise linear approximation; Production; Programming; Unit commitment; mixed-integer linear programming (MLIP); optimization;

fLanguage

English

Publisher

ieee

Conference_Titel

Power Engineering and Automation Conference (PEAM), 2012 IEEE

Conference_Location

Wuhan

Print_ISBN

978-1-4577-1599-0

Type

conf

DOI

10.1109/PEAM.2012.6612511

Filename

6612511