An MILP Formulation for the Unit Commitment Problem Based on State Transitions

This paper proposes a method for establishing unit commitment (UC) problems based on state transitions. Specifically, this paper utilizes states to demonstrate the characteristics of generators, generates all relationships between these states, and establishes UC problems as a mixed-integer linear programming model. Due to this state transition formulation only requires describing the characteristics as states and their state transition relationships, this state transition formulation for UC problems permits more complex operation characteristics. Numerical experiments are conducted in this paper to verify the effectiveness of the state transition formulation for UC problems.