| Title |
Optimal Power Flow Study by The Newton's Method |
| Authors |
Hwang, Kab-Ju(Hwang, Kab-Ju) |
| Abstract |
Optimal Power Flow (OPF) solution by the Newton's method provides a reliable and robust method to classical OPF problems. The major challenge in algorithm development is to identify the binding inequalities efficiently. This paper proposes a simple strategy to identify the binding set. From the mechanism of penalty shifting with soft penalty in trial iteration, an active binding set is identidied automatically. This paper also suggests a technique to solve the linear system whose coefficients are presented in the matrix from. This implementation is highly efficient for sparsity programming. Case studies for 3, 5, 14, 118 bus and practical TPC-190, KEPCO-306 bus systems are performed as well. |