论文信息 - Solution to Economic Dispatching With Disjoint Feasible Regions Via Semidefinite Programming

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.

R. A. Jabr | R. Jabr

[1] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[2] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .

[3] Jon C. Dattorro,et al. Convex Optimization & Euclidean Distance Geometry , 2004 .

[4] Xian Liu. On Compact Formulation of Constraints Induced by Disjoint Prohibited-Zones , 2010, IEEE Transactions on Power Systems.

[5] Christian Kanzow,et al. Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications , 2008, Math. Program..

[6] Malcolm Irving,et al. Economic dispatch of generators with prohibited operating zones: a genetic algorithm approach , 1996 .

[7] Aharon Ben-Tal,et al. Lectures on modern convex optimization , 1987 .