An Optimal Generation Scheduling Approach Based on Linear Relaxation and Mixed Integer Programming

This paper proposes an optimal generation scheduling approach based on linear relaxation and mixed integer programming, which is used to solve the generation dispatch problem. The quadratic transmission loss constraint of each transmission line is converted into linear constraints by using the linear relaxation and mixed integer programming technique. Consequently, the original optimal generation scheduling problem is formulated as a quadratic programming or mixed integer quadratic programming problem that can be solved by commercial optimization solver. In order to improve the efficiency of algorithm, this paper further analyses the generation scheduling model and deletes the redundant variables and constraints. Three test systems, including IEEE 30-node system, IEEE 118-node system, and Polish 2746-node system, are employed to examine the effectiveness of the proposed method. The comparative results obtained by the proposed method, quadratically constrained quadratic programming method (QCQP), and solving constraint integer programs solver (SCIP) verify the effectiveness of the proposed method in solving the optimal generation scheduling problem.