Efficient linear programming algorithm for the transmission network expansion planning problem
Nenhuma Miniatura disponível
Data
2003-09-01
Autores
Hashimoto, SHM
Romero, R.
Mantovani, JRS
Título da Revista
ISSN da Revista
Título de Volume
Editor
Institute of Electrical and Electronics Engineers (IEEE)
Resumo
The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.
Descrição
Palavras-chave
Como citar
Iee Proceedings-generation Transmission and Distribution. Hertford: IEE-inst Elec Eng, v. 150, n. 5, p. 536-542, 2003.