Economic Dispatch Using Quadratic Programming

The economic dispatch problem is formulated as a quadratic programming problem and solved using Wolfe´s algorithm. The method is capable of handling both equality and inequality constraints on p, q, and v and can solve the load flow as well as the economic dispatch problem. The quadratic programming algorithm does not require the use of penalty factors or the determination of gradient step size which can cause convergence difficulties. Convergence was obtained in three iterations for all test systems considered and solution time is small enough to allow the method to be used for on-line dispatching at practical time intervals. Results are presented for 5, 14, 30, 57, and 118 bus test systems.