Security Constrained Dispatch

Abstract
The power system scheduling process is formulated as an optimization problem with linear inequality constraints. The differential algorithm coupled with the simplex procedure is used to optimize the generation schedules. The constraints considered are machine limitations, transmission considerations and system reserve requirements. Taking advantage of the sparse simplex tableau that results when applied to the dispatch problem yields significant reductions in computer storage requirements. Tests indicate that the method is practical for real time application.

This publication has 8 references indexed in Scilit: