Premium
An algorithm for discrete optimal power flow
Author(s) -
Fan Mingtian,
Aoki Kenichi,
Nishikori Akimine,
Nara Koichi
Publication year - 1992
Publication title -
electrical engineering in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.136
H-Index - 28
eISSN - 1520-6416
pISSN - 0424-7760
DOI - 10.1002/eej.4391120111
Subject(s) - integer programming , mathematical optimization , nonlinear programming , power flow , out of kilter algorithm , electric power system , algorithm , mathematics , linear programming , nonlinear system , integer (computer science) , computer science , power (physics) , dijkstra's algorithm , graph , physics , discrete mathematics , quantum mechanics , shortest path problem , programming language
Abstract This paper presents a new algorithm to solve an optimal power flow problem which can take into consideration the discrete nature of some facilities in power systems. The optimal power flow problem is formulated as a nonlinear mixed‐integer programming problem in which the number of transformer taps and the number of shunt capacitor units and reactor units are treated as discrete variables. This paper attempts to solve such a large‐scale nonlinar mixed‐integer programming problem by some effective programming techniques. The optimization procedure of the algorithm is that the nonlinear mixed‐integer programming problem is linearized iteratively and solved by an approximation method for linear mixed‐integer programming. A fundamental feature of the algorithm is that it can guarantee a solution which is discrete, feasible and near‐optimal. The validity and efficiency of the algorithm is demonstrated by the numerical results of real‐scale optimal power flow problems.