A solution to security constrained non-convex economic dispatch problem by modified subgradient algorithm based on feasible values

A security constrained power dispatch problem with non-convex total cost rate function for a lossy electric power system is formulated. Then, an iterative solution method proposed by us and based on modified subgradient algorithm operating on feasible values (F-MSG) is used to solve it. Since all equality and inequality constraints in our nonlinear optimization model are functions of bus voltage magnitudes and phase angles, off-nominal tap settings and susceptance values of svar systems, they are taken as independent variables. Load flow equations are added to the model as equality constraints. The unit generation constraints, transmission line capacity constraints, bus voltage magnitude constraints, off-nominal tap setting constraints and svar system susceptance value constraints are added into the optimization problem as inequality constraints. Since F-MSG algorithm requires that all inequality constraints should be expressed in equality constraint form, all inequality constraints are converted into equality constraints by the method, which does not add any extra independent variable into the model and reducing the solution time because of it, before application of it to the optimization model. The proposed technique is tested on IEEE 30-bus and IEEE 57 bus test systems. The minimum total cost rates and the solution times obtained from F-MSG algorithm and from the other techniques are compared, and the outperformance of the F-MSG algorithm with respect to the other methods in each test system is demonstrated. (C) 2012 Elsevier Ltd. All rights reserved.