Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/72444
- Title:
- Multi-area decentralized optimal VAr planning using the Dantzig-Wolfe decomposition principle
- Universidade Estadual Paulista (UNESP)
- Universidad Tecnologica de Pereira
- This paper presents a new methodology for solving the optimal VAr planning problem in multi-area electric power systems, using the Dantzig-Wolfe decomposition. The original multi-area problem is decomposed into subproblems (one for each area) and a master problem (coordinator). The solution of the VAr planning problem in each area is based on the application of successive linear programming, and the coordination scheme is based on the reactive power marginal costs in the border bus. The aim of the model is to provide coordinated mechanisms to carry out the VAr planning studies maximizing autonomy and confidentiality for each area, assuring global economy to the whole system. Using the mathematical model and computational implementation of the proposed methodology, numerical results are presented for two interconnected systems, each of them composed of three equal subsystems formed by IEEE30 and IEEE118 test systems. © 2011 IEEE.
- 31-May-2011
- 2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America, T and D-LA 2010, p. 92-98.
- 92-98
- Dantzig-Wolfe
- multi-area VAr planning
- optimal power flow successive linear programming
- optimal reactive dispatch
- Computational implementations
- Coordination scheme
- Dantzig-wolfe decomposition
- Global economies
- Interconnected systems
- Marginal costs
- Numerical results
- Reactive dispatch
- Sub-problems
- Successive linear programming
- Test systems
- VAr Planning
- Whole systems
- Electric power transmission
- Linear programming
- Mathematical models
- Optimization
- Value engineering
- http://dx.doi.org/10.1109/TDC-LA.2010.5762866
- Acesso restrito
- outro
- http://repositorio.unesp.br/handle/11449/72444
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.