Journal
IEEE TRANSACTIONS ON POWER SYSTEMS
Volume 27, Issue 1, Pages 572-573Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2011.2166009
Keywords
Mathematical programming; power generation dispatch; semidefinite programming; vanishing constraints
Categories
Funding
- American University of Beirut Research Board
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
