Optimization of Reactive Power Expansion Planning

摘要

This article presents a penalty successive linear programming approach for optimum investment of reactive power in networks. Unlike many successive linear programming algorithms, the proposed approach is based on a successive linear programming framework that admits a convergence proof for non-linearly constrained problems of general form. The penalty successive linear programming approach produces a pattern of new reactive sources that satisfy voltage profile requirements in normal and contingent states of operation, and it also accounts for voltage stability constraints that guard against voltage collapse. Numerical test results are presented and compared with an optimal power flow based planning method that processes the system states sequentially.