Recursive convex approximations for optimal power flow solution in direct current networks
The optimal power flow problem in direct current (DC) networks considering dispersal generation is addressed in this paper from the recursive programming point of view. The nonlinear programming model is transformed into two quadratic programming approximations that are convex since the power balanc...
- Autores:
-
Ocampo-Toro, Jauder Alexander
Montoya, Oscar Danilo
Grisales-Norena, Luis Fernando
- Tipo de recurso:
- Fecha de publicación:
- 2022
- Institución:
- Universidad Tecnológica de Bolívar
- Repositorio:
- Repositorio Institucional UTB
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.utb.edu.co:20.500.12585/12215
- Acceso en línea:
- https://hdl.handle.net/20.500.12585/12215
- Palabra clave:
- Approximation
Direct current networks
Metaheuristic optimization
Optimal power flow problem
Programming
Quadratic convex
Recursive convex
Techniques
- Rights
- openAccess
- License
- http://creativecommons.org/licenses/by-nc-nd/4.0/