Title :
Solution to Economic Dispatching With Disjoint Feasible Regions Via Semidefinite Programming
Author_Institution :
Dept. of Electr. & Comput. Eng., American Univ. of Beirut, Beirut, Lebanon
Abstract :
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.
Keywords :
convex programming; iterative methods; power generation dispatch; power generation economics; Shor semideflnite relaxation scheme; convex iteration; disjoint feasible region; economic dispatching; mathematical program; rank constraint; semidefinite programming approach; Dispatching; Economics; Generators; Loading; Matrices; Symmetric matrices; Mathematical programming; power generation dispatch; semidefinite programming; vanishing constraints;
Journal_Title :
Power Systems, IEEE Transactions on
DOI :
10.1109/TPWRS.2011.2166009
