dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2014-05-20T13:28:57Z
dc.date.accessioned2022-10-05T13:27:16Z
dc.date.available2014-05-20T13:28:57Z
dc.date.available2022-10-05T13:27:16Z
dc.date.created2014-05-20T13:28:57Z
dc.date.issued2005-09-01
dc.identifierElectric Power Systems Research. Lausanne: Elsevier B.V. Sa, v. 76, n. 1-3, p. 9-16, 2005.
dc.identifier0378-7796
dc.identifierhttp://hdl.handle.net/11449/9685
dc.identifier10.1016/j.epsr.2005.02.007
dc.identifierWOS:000235538000002
dc.identifier0614021283361265
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3885999
dc.description.abstractThis 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.
dc.languageeng
dc.publisherElsevier B.V.
dc.relationElectric Power Systems Research
dc.relation2.856
dc.relation1,048
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjecttransmission network synthesis
dc.subjectinterior point method
dc.subjectrelaxed optimization models
dc.subjectnetwork expansion planning
dc.subjecttransportation model
dc.subjectconstructive heuristic algorithms
dc.titleInterior point algorithm for linear programming used in transmission network synthesis
dc.typeArtigo


Este ítem pertenece a la siguiente institución