Interior point algorithm for linear programming used in transmission network synthesis

Nenhuma Miniatura disponível

Data

2005-09-01

Autores

Sanchez, I. G.
Romero, R.
Mantovani, JRS
Garcia, A.

Título da Revista

ISSN da Revista

Título de Volume

Editor

Elsevier B.V.

Resumo

This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.

Descrição

Palavras-chave

transmission network synthesis, interior point method, relaxed optimization models, network expansion planning, transportation model, constructive heuristic algorithms

Como citar

Electric Power Systems Research. Lausanne: Elsevier B.V. Sa, v. 76, n. 1-3, p. 9-16, 2005.