Tie-Line Constrained Multi-Area Generation Scheduling Using Mixed Integer Programming Part I: Problem Formulation

The objective of this research work is to search for an appropriate generation schedule satisfying system constraints and unit operation constraints with effective spinning reserve. The work was presented in two papers, which are part I and part II. This part I paper deploys the problem formulation of generation scheduling with virtual load constraints to ensure that spinning reserve could be used effectively without line congestion problem by expecting higher load demand in next few minutes. The part II paper is the simulation result and discussion of the proposed method. In the proposed method, the hybrid mixed integer programming process includes mixed-integer linear programming and quadratic programming (MILP-QP) is used to find the feasible solutions with total cost minimization while satisfying all important constraints. MILP is used to find generation schedule whereas QP is used to perform economic dispatch.