OPTIMUM DESIGN OF TRUSSES FROM AVAILABLE SECTIONS—USE OF SEQUENTIAL LINEAR PROGRAMMING WITH BRANCH AND BOUND ALGORITHM

Abstract

Optimal design of trusses requires the use of available discrete sections. The improved move limit method of sequential linear programming is a well established procedure for the optimal design of trusses. The branch and bound discrete linear programming method is effectively merged with sequential linear programming for the discrete optimal design of trusses. This algorithm is tested with a large number of examples to verify its usefulness for large problems with multiple loading conditions, the choice of a proper move limit factor, developing some approximate methods and possible extension to problems with frequency constraints. Two approximate methods are developed for the solution of the problem which gives results permitting the discrete solutions to be compared.