Journal article published in 2010 by
Adelaide Cerveira,
Agostinho Agra,
Fernando Bastos,
Theodore E. Simos,
Humberto Varum ,
George Psihoyios,
C.-H. Tsitouras

One of the classical problems in the structural optimization field is the Truss Topology Design Problem (TTDP) which deals with the selection of optimal configuration for structural systems for applications in mechanical, civil, aerospace engineering, among others. In this paper we consider a TTDP where the goal is to find the stiffest truss, under a given load and with a bound on the total volume. The design variables are the cross‐section areas of the truss bars that must be chosen from a given finite set. This results in a large‐scale non‐convex problem with discrete variables. This problem can be formulated as a Semidefinite Programming Problem (SDP problem) with binary variables. We propose a branch and bound algorithm to solve this problem. In this paper it is considered a binary formulation of the problem, to take advantage of its structure, which admits a Knapsack problem as subproblem. Thus, trying to improve the performance of the Branch and Bound, at each step, some valid inequalities for the Knapsack problem are included.