We present a dynamic programming algorithm for solving the single-Unit Commitment (1UC) problem with ramping constraints and arbitrary convex cost function. The algorithm is based on a new approach for efficiently solving the single-unit Economic Dispatch (ED) problem with ramping constraints and arbitrary convex cost functions, improving on previously known ones that were limited to piecewise-linear functions. For simple convex functions, such as the quadratic ones typically used in applications, the solution cost of all the involved (ED) problems, comprised that of finding an optimal primal and dual solution, is O(n^3). Coupled with a "smart" visit of the state-space graph in the dynamic programming algorithm, this enables one to solve (1UC) in O(n^3) overall.
Solving nonlinear single-unit commitment problems with ramping constraints
FRANGIONI, ANTONIO;
2006-01-01
Abstract
We present a dynamic programming algorithm for solving the single-Unit Commitment (1UC) problem with ramping constraints and arbitrary convex cost function. The algorithm is based on a new approach for efficiently solving the single-unit Economic Dispatch (ED) problem with ramping constraints and arbitrary convex cost functions, improving on previously known ones that were limited to piecewise-linear functions. For simple convex functions, such as the quadratic ones typically used in applications, the solution cost of all the involved (ED) problems, comprised that of finding an optimal primal and dual solution, is O(n^3). Coupled with a "smart" visit of the state-space graph in the dynamic programming algorithm, this enables one to solve (1UC) in O(n^3) overall.File | Dimensione | Formato | |
---|---|---|---|
1UCwRC.pdf
accesso aperto
Descrizione: Documento in Post-print
Tipologia:
Documento in Post-print
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
168.33 kB
Formato
Adobe PDF
|
168.33 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.