Portal de Periódicos da CAPES

Planejamento da expansão de sistemas de transmissão usando algoritmos tipo dual simplex especializados em uma estrutura branch and bound

2013; Linguagem: Inglês

2639-6459

Jeferson Back Vanderlinde,

Business and Management Studies

This research considers the theoretical analysis and computational implementation of the Dual Simplex algorithm for Bounded Variables specializes in efficient re-optimization of sub-problems generated by the Branch and Bound algorithm to solve Mixed-Integer Linear Programming problems. Along with these algorithms has been implemented Primal Simplex algorithm for Bounded Variables to solve the initial Linear Programming problem result of a Mixed-Integer Linear Programming problem after relaxing the integrality of the variables. These algorithms has been adequately analyzed and implemented via the computer language FORTRAN 77. The methodology has been tested on the Transmission Network Expansion Planning based on a transportation model that results in a Mixed-Integer Linear Programming.