Tight mixed integer linear programming formulations for generator Self-Scheduling

This paper examines the polytope of feasible power generation schedules for Self Scheduling problems. We introduce a new class of inequalities for the linear programming relaxation, giving a tighter description of feasible operating schedules for generators. Computational results show that these inequalities can significantly reduce overall solution times for the mixed-integer problem. These inequalities can also be applied in other power-generation problems that determine the operating schedules of generators, such as unit-commitment problems.