By Topic

Solution to Economic Dispatching With Disjoint Feasible Regions Via Semidefinite Programming

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
$33 $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

1 Author(s)
R. A. Jabr ; Department of Electrical & Computer Engineering, American University of Beirut, Beirut, Lebanon

This paper presents a semidefinite programming approach for the solution of scheduling problems that have disjoint feasible regions. The approach is based on formulating the problem as a mathematical program with vanishing constraints. The solution is obtained using Shor's semidefinite relaxation scheme combined with a rank constraint which is enforced via convex iteration.

Published in:

IEEE Transactions on Power Systems  (Volume:27 ,  Issue: 1 )