Rider, Marcos J.Garcia, Ariovaldo V.Romero, Rubén [UNESP]2014-05-272014-05-272007-12-012007 IEEE Lausanne POWERTECH, Proceedings, p. 1350-1355.http://hdl.handle.net/11449/70027This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.1350-1355engBranch-and-bound algorithmDC modelHigher order interior point methodMixed integer nonlinear programmingPower transmission planningBoolean functionsComputer networksDynamic programmingElectric power transmissionElectric power transmission networksLinearizationMathematical programmingNonlinear programmingLinear programmingTrabalho apresentado em evento10.1109/PCT.2007.4538512Acesso aberto2-s2.0-50849145134