By Topic

A fast algorithm for power system optimization problems using an interior point method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ponnambalam, K. ; Waterloo Univ., Ont., Canada ; Quintana, V.H. ; Vannelli, A.

An implementation of the dual affine (DA) algorithm, which is a variant of Karmarkar's interior point method, is described. In the DA algorithm, the problem solved is usually the dual of the original linear programming (LP) problem, and it is applicable to linear and nonlinear optimization problems. An application of the proposed optimization technique to hydro-scheduling is presented. The largest problem comprised 880 variables and 3680 constraints and was solved over nine times faster than an efficient simplex (MINOS) code. As the problem size grows, the speedup ratio over the simplex method also increases. A new heuristic basis recovery procedure was implemented to provide primal and dual optimal basic solutions. The tested examples indicate that this approach requires less than 10% of the original iterations of the simplex method to find the optimal basis

Published in:

Power Systems, IEEE Transactions on  (Volume:7 ,  Issue: 2 )