Power-system load scheduling with security constraints using dual linear programming

Abstract

The optimisation of power-system operating conditions is formulated as a dual linear programming problem. This suboptimal model allows fast solutions to be obtained dependably by applying the revised simplex l.p. method to the problem of minimising total generation costs subject to the constraints imposed. These constraints include the network equations, the inequalities restricting generator loading, runningspare capacity and transmission-line loading under normal and outage conditions. The fast speed of solution and low computer-storage requirements result from the reduced mathematical model developed by means of the variable eleimination and the computing strategy used. The computational procedure automatically adjusts the size of the problem to be solved according to indications obtained of the likely critical lineoutage security constraints, a small number in relation to the prohibitively large number of possible outage constraints. A sample application of the method is given for a 2700MW, 275/132kV system of 23 busbars, 30 lines and transformers, supplied by 24 generators. Using ALGOL 60 on the Atlas computer, solutions were obtained in 5s neglecting line-outage security, and 11.5s including security under all possible single-line-outage conditions. For accuracy, comparisons are also made with the network-flow technique and the full nonlinear programming solutions.