Solution to Economic Dispatching With Disjoint Feasible Regions Via Semidefinite Programming

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.