Optimal power flow solution including the syncronous generator capability curve constraints with a convex relaxation method

In this work is proposed a solution method for the optimal power flow (OPF) problem, including the synchronous generator capability curve constraints (SGCC). OPF is a non-convex, non-linear, and hard to solve optimization problem. When synchronous generator operational limits are not concerned, OPF solution could not be applicable in real scenarios, taking the machine to operate with winding currents above acceptable values. The SGCC used in this research includes current and power limits allowed in the generator, preventing the machine operation against overheating and excessive mechanical efforts. Convex relaxation methods show a great performance, allowing the problem to be solved in a simpler and way. Thus, OPF is formulated over a second order cone programming (SOCP) approach from convex relaxation techniques, aiming the active power generators cost minimization, subject to the electrical transmission network constraints. SGCC used has a convex form, which allows the convex programming method application, with no convexification need for the optimization model. The proposed method was implemented in MATLAB
^®
environment and applied to IEEE 30-bus test system. Simulation results demonstrate the applicability and good performance of the proposed method, so that solutions do not violate the constraints imposed by the actual operational limits of the generators.