Portal de Periódicos da CAPES

Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem

2011; Institute of Electrical and Electronics Engineers; Volume: 27; Issue: 1 Linguagem: Inglês

10.1109/tpwrs.2011.2162008

1558-0679

James Ostrowski, Miguel F. Anjos, Anthony Vannelli,

Power System Reliability and Maintenance

This paper examines the polytope of feasible power generation schedules in the unit commitment (UC) problem. We provide computational results comparing formulations for the UC problem commonly found in the literature. We introduce a new class of inequalities, giving a tighter description of feasible operating schedules for generators. Computational results show that these inequalities can significantly reduce overall solution times.