Abstract
A new semidefinite programming (SDP) method with graph partitioning technique to solve optimal power flow (OPF) problems is presented in this paper. The non-convex OPF problem is converted into its convex SDP model at first, and then according to the characters of power system network, the matrix variable of SDP is re-arranged using the chordal extension of its aggregate sparsity pattern by the graph partitioning technique. A new SDP-OPF model is reformulated with the re-arranged matrix variable, and can be solved by the interior point method (IPM) for SDP. This method can reduce the consumption of computer memory and improve the computing performance significantly. Extensive numerical simulations on seven test systems with sizes up to 542 buses have shown that this new method of SDP-OPF can guarantee the global optimal solutions within the polynomial time same as the original SDP-OPF, but less CPU times and memory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Electrical Power & Energy Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
