An Algorithm for Discrete Optimal Power Flow

Abstract

This paper presents a new algorithm to solve an optimal power flow problem which can take into considerations 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 nonlinear mixed-integer problem by some effective programming techniques. The optimization procedure of the algorithm is that the nonlinear mixed-integer programming problem is iteratively linearized 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 both 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.