http://www.cnr.it/ontology/cnr/individuo/prodotto/ID7276
Solving Nonlinear Single-Unit Commitment problems with ramping constraints (Articolo in rivista)
- Type
- Label
- Solving Nonlinear Single-Unit Commitment problems with ramping constraints (Articolo in rivista) (literal)
- Anno
- 2006-01-01T00:00:00+01:00 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Frangioni, A.; Gentile, C. (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
- Note
- Scopus (literal)
- ISI Web of Science (WOS) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- Frangioni Antonio, Università di Pisa, Dipartimento di Informatica,
associato alla ricerca presso IASI (literal)
- Titolo
- Solving Nonlinear Single-Unit Commitment problems with ramping constraints (literal)
- Abstract
- We present a dynamic programming algorithm for solving the
Single-Unit Commitment (1UC) problem with ramping constraints and
arbitrary convex cost functions. 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 special visit
of the state-space graph in the dynamic programming algorithm, that
enables one to solve (1UC) with simple convex functions in~$O(n^3)$
overall. (literal)
- Prodotto di
- Autore CNR
- Insieme di parole chiave
Incoming links:
- Autore CNR di
- Prodotto
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
- Insieme di parole chiave di
