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

Author

Madrigal, Marcelino ; Quintana, Victor H.

Author_Institution

Inst. Tecnologico de Morelia, Mexico

Volume

2

fYear

1999

fDate

1999

Firstpage

697

Abstract

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

Keywords

mathematical programming; power generation dispatch; power generation economics; power generation planning; power generation scheduling; Lagrangian relaxation approach; dynamic programming; generation unit commitment; generator status; semidefinite programming relaxations; static quadratic economic dispatch problem; {0,1}-power dispatch problems; Bismuth; Cost function; Dynamic programming; Heuristic algorithms; Lagrangian functions; Power generation; Power generation economics; Power supplies; Production; Symmetric matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Power Engineering Society Summer Meeting, 1999. IEEE

Conference_Location

Edmonton, Alta.

Print_ISBN

0-7803-5569-5

Type

conf

DOI

10.1109/PESS.1999.787402

Filename

787402