Convex Formulation for Optimal Active and Reactive Power Dispatch
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | por |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1109/TLA.2022.9693563 http://hdl.handle.net/11449/230350 |
Resumo: | This paper proposes a convex programming model to solve the optimal power flow problem (OPF) related to the problems of generation active power dispatch and opportunity costs to meet the reactive power needs in energy markets. The problem is initially represented as a bilevel optimization problem where the upper level considers the minimization of opportunity costs of generating units through a second-order cone programming OPF model, and the lower level is a linear programming model that minimizes the value of active power offered by generators to the market energy. Subsequently, through the concept of strong duality, the problem is transformed into a one-level convex optimization model. Comparisons of the proposed modeling with other level formulations are presented. Results are presented for the IEEE14 and IEEE30 bus systems. |
id |
UNSP_da3cc498f8015f890fe1f6a64bf947f3 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/230350 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Convex Formulation for Optimal Active and Reactive Power DispatchCostsIEEE transactionsJacobian matricesLoad flowOptimizationProgrammingReactive powerThis paper proposes a convex programming model to solve the optimal power flow problem (OPF) related to the problems of generation active power dispatch and opportunity costs to meet the reactive power needs in energy markets. The problem is initially represented as a bilevel optimization problem where the upper level considers the minimization of opportunity costs of generating units through a second-order cone programming OPF model, and the lower level is a linear programming model that minimizes the value of active power offered by generators to the market energy. Subsequently, through the concept of strong duality, the problem is transformed into a one-level convex optimization model. Comparisons of the proposed modeling with other level formulations are presented. Results are presented for the IEEE14 and IEEE30 bus systems.Universidade do Estado de Mato GrossoSao Paulo State University – UNESP - Ilha Solteira BrazilAalto universityDepartment of Electrical Engineering Power System Planning Lab Sao Paulo State University (UNESP) Ilha Solteira–SP BrazilSao Paulo State University – UNESP - Ilha Solteira BrazilDepartment of Electrical Engineering Power System Planning Lab Sao Paulo State University (UNESP) Ilha Solteira–SP BrazilUniversidade do Estado de Mato GrossoUniversidade Estadual Paulista (UNESP)Aalto universityViegas da Silva, MauroHome Ortiz, Juan Manuel [UNESP]Pourakbari-Kasmaei, MahdiSanches Mantovani, Jose Roberto [UNESP]2022-04-29T08:39:25Z2022-04-29T08:39:25Z2022-05-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article787-798http://dx.doi.org/10.1109/TLA.2022.9693563IEEE Latin America Transactions, v. 20, n. 5, p. 787-798, 2022.1548-0992http://hdl.handle.net/11449/23035010.1109/TLA.2022.96935632-s2.0-85124190531Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPporIEEE Latin America Transactionsinfo:eu-repo/semantics/openAccess2022-04-29T08:39:25Zoai:repositorio.unesp.br:11449/230350Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462022-04-29T08:39:25Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Convex Formulation for Optimal Active and Reactive Power Dispatch |
title |
Convex Formulation for Optimal Active and Reactive Power Dispatch |
spellingShingle |
Convex Formulation for Optimal Active and Reactive Power Dispatch Viegas da Silva, Mauro Costs IEEE transactions Jacobian matrices Load flow Optimization Programming Reactive power |
title_short |
Convex Formulation for Optimal Active and Reactive Power Dispatch |
title_full |
Convex Formulation for Optimal Active and Reactive Power Dispatch |
title_fullStr |
Convex Formulation for Optimal Active and Reactive Power Dispatch |
title_full_unstemmed |
Convex Formulation for Optimal Active and Reactive Power Dispatch |
title_sort |
Convex Formulation for Optimal Active and Reactive Power Dispatch |
author |
Viegas da Silva, Mauro |
author_facet |
Viegas da Silva, Mauro Home Ortiz, Juan Manuel [UNESP] Pourakbari-Kasmaei, Mahdi Sanches Mantovani, Jose Roberto [UNESP] |
author_role |
author |
author2 |
Home Ortiz, Juan Manuel [UNESP] Pourakbari-Kasmaei, Mahdi Sanches Mantovani, Jose Roberto [UNESP] |
author2_role |
author author author |
dc.contributor.none.fl_str_mv |
Universidade do Estado de Mato Grosso Universidade Estadual Paulista (UNESP) Aalto university |
dc.contributor.author.fl_str_mv |
Viegas da Silva, Mauro Home Ortiz, Juan Manuel [UNESP] Pourakbari-Kasmaei, Mahdi Sanches Mantovani, Jose Roberto [UNESP] |
dc.subject.por.fl_str_mv |
Costs IEEE transactions Jacobian matrices Load flow Optimization Programming Reactive power |
topic |
Costs IEEE transactions Jacobian matrices Load flow Optimization Programming Reactive power |
description |
This paper proposes a convex programming model to solve the optimal power flow problem (OPF) related to the problems of generation active power dispatch and opportunity costs to meet the reactive power needs in energy markets. The problem is initially represented as a bilevel optimization problem where the upper level considers the minimization of opportunity costs of generating units through a second-order cone programming OPF model, and the lower level is a linear programming model that minimizes the value of active power offered by generators to the market energy. Subsequently, through the concept of strong duality, the problem is transformed into a one-level convex optimization model. Comparisons of the proposed modeling with other level formulations are presented. Results are presented for the IEEE14 and IEEE30 bus systems. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-04-29T08:39:25Z 2022-04-29T08:39:25Z 2022-05-01 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1109/TLA.2022.9693563 IEEE Latin America Transactions, v. 20, n. 5, p. 787-798, 2022. 1548-0992 http://hdl.handle.net/11449/230350 10.1109/TLA.2022.9693563 2-s2.0-85124190531 |
url |
http://dx.doi.org/10.1109/TLA.2022.9693563 http://hdl.handle.net/11449/230350 |
identifier_str_mv |
IEEE Latin America Transactions, v. 20, n. 5, p. 787-798, 2022. 1548-0992 10.1109/TLA.2022.9693563 2-s2.0-85124190531 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.none.fl_str_mv |
IEEE Latin America Transactions |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
787-798 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1803649891737534464 |