dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorHashimoto, SHM
dc.creatorRomero, R.
dc.creatorMantovani, JRS
dc.date2014-05-20T15:24:40Z
dc.date2016-10-25T17:58:58Z
dc.date2014-05-20T15:24:40Z
dc.date2016-10-25T17:58:58Z
dc.date2003-09-01
dc.date.accessioned2017-04-05T23:48:34Z
dc.date.available2017-04-05T23:48:34Z
dc.identifierIee Proceedings-generation Transmission and Distribution. Hertford: IEE-inst Elec Eng, v. 150, n. 5, p. 536-542, 2003.
dc.identifier1350-2360
dc.identifierhttp://hdl.handle.net/11449/35238
dc.identifierhttp://acervodigital.unesp.br/handle/11449/35238
dc.identifier10.1049/ip-gtd:20030656
dc.identifierWOS:000185891600004
dc.identifierhttp://dx.doi.org/10.1049/ip-gtd:20030656
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/879010
dc.descriptionThe 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.
dc.languageeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relationIEE Proceedings: Generation, Transmission and Distribution
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.titleEfficient linear programming algorithm for the transmission network expansion planning problem
dc.typeOtro


Este ítem pertenece a la siguiente institución