Optimum allocation of spinning reserve by quadratic programming

Abstract

Quadratic programming offers attractive advantages as an optimisation technique in power-system optimumdispatch problems. A quadratic cost function can be minimised, subject to constraints linearised through sensitivity coefficients. If, however, there is a spinning-reserve requirement, the spinning-reserve characteristics of the individual generators cannot be effectively linearised through the sensitivity coefficients. To solve this problem, a technique known as quadratic-approximation programming is used. Limits on the transmission-line current are also incorporated in the algorithm. It is shown that the minimum-cost dispatch problem, subject to a specified spinning reserve and the maximum-spinning-reserve problem, can be easily solved with moderate computing-time requirements.