Abstract
This paper presents a new algorithm of the interior point quadratic programming which can solve large scale optimal power flow problems with profoundly less computational efforts and can start from either a feasible or an infeasible point. Numerical results on the IEEE test systems and a Japanese 344 bus system (2301 variables, 2222 equality constraints and 1534 inequality constraints) have verified that the proposed algorithm possesses enough robustness and reliability and is especially suitable for on-line use as well as off-line use for large scale systems
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 callDisclaimer: 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.
