An interior point nonlinear programming for optimal power flow problems with a novel data structure

H. Wei, H. Sasaki, J. Kubokawa, R. Yokoyama

    Research output: Contribution to journalArticle

    Abstract

    This paper presents a new interior point nonlinear programming algorithm for optimal power flow problems (OPF) based on the perturbed KKT conditions of the primal problem. Through the concept of the centering direction, we extend this algorithm to classical power flow (PF) and approximate OPF problems. For the latter, CPU time can be reduced substantially. To efficiently handle functional inequality constraints, a reduced correction equation is derived, the size of which depends on that of equality constraints. A novel data structure is proposed which has been realized by rearranging the correction equation, Compared with the conventional data structure of Newton OPF, the number of fill-ins of the proposed scheme is roughly halved and CPU time is reduced by about 15% for large scale systems. The proposed algorithm includes four kinds of objective functions and two different data structures. Extensive numerical simulations on test systems that range in size from 14 to 1047 buses, have shown that the proposed method is very promising for large scale application due to its robustness and fast execution time.

    Original languageEnglish
    Pages (from-to)59
    Number of pages1
    JournalIEEE Power Engineering Review
    Volume17
    Issue number12
    Publication statusPublished - 1997

    Fingerprint

    Nonlinear programming
    Data structures
    Program processors
    Large scale systems
    Computer simulation

    Keywords

    • Approximate opf
    • Centering direction
    • Interior point nonlinear programming
    • Optimal power flow
    • Perturbed kkt conditions

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    An interior point nonlinear programming for optimal power flow problems with a novel data structure. / Wei, H.; Sasaki, H.; Kubokawa, J.; Yokoyama, R.

    In: IEEE Power Engineering Review, Vol. 17, No. 12, 1997, p. 59.

    Research output: Contribution to journalArticle

    Wei, H. ; Sasaki, H. ; Kubokawa, J. ; Yokoyama, R. / An interior point nonlinear programming for optimal power flow problems with a novel data structure. In: IEEE Power Engineering Review. 1997 ; Vol. 17, No. 12. pp. 59.
    @article{7254c6148395449887927289cf1fa1e7,
    title = "An interior point nonlinear programming for optimal power flow problems with a novel data structure",
    abstract = "This paper presents a new interior point nonlinear programming algorithm for optimal power flow problems (OPF) based on the perturbed KKT conditions of the primal problem. Through the concept of the centering direction, we extend this algorithm to classical power flow (PF) and approximate OPF problems. For the latter, CPU time can be reduced substantially. To efficiently handle functional inequality constraints, a reduced correction equation is derived, the size of which depends on that of equality constraints. A novel data structure is proposed which has been realized by rearranging the correction equation, Compared with the conventional data structure of Newton OPF, the number of fill-ins of the proposed scheme is roughly halved and CPU time is reduced by about 15{\%} for large scale systems. The proposed algorithm includes four kinds of objective functions and two different data structures. Extensive numerical simulations on test systems that range in size from 14 to 1047 buses, have shown that the proposed method is very promising for large scale application due to its robustness and fast execution time.",
    keywords = "Approximate opf, Centering direction, Interior point nonlinear programming, Optimal power flow, Perturbed kkt conditions",
    author = "H. Wei and H. Sasaki and J. Kubokawa and R. Yokoyama",
    year = "1997",
    language = "English",
    volume = "17",
    pages = "59",
    journal = "IEEE Power Engineering Review",
    issn = "0272-1724",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "12",

    }

    TY - JOUR

    T1 - An interior point nonlinear programming for optimal power flow problems with a novel data structure

    AU - Wei, H.

    AU - Sasaki, H.

    AU - Kubokawa, J.

    AU - Yokoyama, R.

    PY - 1997

    Y1 - 1997

    N2 - This paper presents a new interior point nonlinear programming algorithm for optimal power flow problems (OPF) based on the perturbed KKT conditions of the primal problem. Through the concept of the centering direction, we extend this algorithm to classical power flow (PF) and approximate OPF problems. For the latter, CPU time can be reduced substantially. To efficiently handle functional inequality constraints, a reduced correction equation is derived, the size of which depends on that of equality constraints. A novel data structure is proposed which has been realized by rearranging the correction equation, Compared with the conventional data structure of Newton OPF, the number of fill-ins of the proposed scheme is roughly halved and CPU time is reduced by about 15% for large scale systems. The proposed algorithm includes four kinds of objective functions and two different data structures. Extensive numerical simulations on test systems that range in size from 14 to 1047 buses, have shown that the proposed method is very promising for large scale application due to its robustness and fast execution time.

    AB - This paper presents a new interior point nonlinear programming algorithm for optimal power flow problems (OPF) based on the perturbed KKT conditions of the primal problem. Through the concept of the centering direction, we extend this algorithm to classical power flow (PF) and approximate OPF problems. For the latter, CPU time can be reduced substantially. To efficiently handle functional inequality constraints, a reduced correction equation is derived, the size of which depends on that of equality constraints. A novel data structure is proposed which has been realized by rearranging the correction equation, Compared with the conventional data structure of Newton OPF, the number of fill-ins of the proposed scheme is roughly halved and CPU time is reduced by about 15% for large scale systems. The proposed algorithm includes four kinds of objective functions and two different data structures. Extensive numerical simulations on test systems that range in size from 14 to 1047 buses, have shown that the proposed method is very promising for large scale application due to its robustness and fast execution time.

    KW - Approximate opf

    KW - Centering direction

    KW - Interior point nonlinear programming

    KW - Optimal power flow

    KW - Perturbed kkt conditions

    UR - http://www.scopus.com/inward/record.url?scp=35848951866&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=35848951866&partnerID=8YFLogxK

    M3 - Article

    VL - 17

    SP - 59

    JO - IEEE Power Engineering Review

    JF - IEEE Power Engineering Review

    SN - 0272-1724

    IS - 12

    ER -