By Topic

Semidefinite programming relaxations for {0,1}-power dispatch problems

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

2 Author(s)
M. Madrigal ; Inst. Tecnologico de Morelia, Mexico ; A. D. Quintana

Semidefinite programming (SDP) relaxations for two {0,1}-power-dispatch problems are presented in this paper. The first problem deals with the solution of a static quadratic economic dispatch problem, where generators status (on or off) and power levels to supply a load are to be determined. Within Lagrangian relaxation approaches to solve generation unit commitment (UC) problems, the solution to single-unit subproblems has always been carried out using dynamic programming (DP) algorithms. The second problem deals with a SDP-relaxation of such UC-subproblems. Preliminary results show that SDP-relaxations represent a promising approach to solve these and other {0,1}-power dispatch problems

Published in:

Power Engineering Society Summer Meeting, 1999. IEEE  (Volume:2 )

Date of Conference:

1999