Sequential quadratic programming models for solving the OPF problem in DC grids
In this paper, we address the optimal power flow problem in dc grids (OPF-DC). Our approach is based on sequential quadratic programming which solves the problem associated with non-convexity of the model. We propose two different linearizations and compare them to a non-linear algorithm. The first...
- Autores:
- Tipo de recurso:
- Fecha de publicación:
- 2019
- Institución:
- Universidad Tecnológica de Bolívar
- Repositorio:
- Repositorio Institucional UTB
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.utb.edu.co:20.500.12585/9156
- Acceso en línea:
- https://hdl.handle.net/20.500.12585/9156
- Palabra clave:
- Direct current power grids
Linearization via Newton–Raphson method
Optimal power flow problem
Quadratic reformulations
Voltage-current formulation
Acoustic generators
Constraint theory
Electric load flow
Electric power transmission networks
Linearization
Quadratic programming
Direct current power
Optimal power flow problem
Quadratic reformulations
Raphson methods
Voltage current
Problem solving
- Rights
- restrictedAccess
- License
- http://creativecommons.org/licenses/by-nc-nd/4.0/
| Summary: | In this paper, we address the optimal power flow problem in dc grids (OPF-DC). Our approach is based on sequential quadratic programming which solves the problem associated with non-convexity of the model. We propose two different linearizations and compare them to a non-linear algorithm. The first model is a Newton-based linearization which takes the Jacobian of the power flow as a linearization for the optimization stage, and the second model uses the nodal currents as auxiliary variables to linearize over the inequality constraints. Simulation results in radial and meshed grids demonstrate the efficiency of the proposed methodology and allow finding the same solution given by the exact nonlinear representation of the OPF-DC problem. © 2018 Elsevier B.V. |
|---|