A branch and bound algorithm using the hybrid linear model in the transmission network expansion planning

This paper proposes a branch and bound algorithm for the transmission network expansion planning problem, which is mathematically modeled by the hybrid linear model. The algorithm employs pseudo-costs for selecting the subproblems and also for the variable of subproblem separation. The LP problems are solved by using a commercial optimization subroutine. The performance of the branch and bound problem is presented from tests with a well known system in the technical literature.