Comparison of the numerical efficiency of different sequential linear programming based algorithms for structural optimisation problems

Amongst the different optimisation methods, the Sequential Linear Programming (S.L.P.) is very popular because of its conceptual simplicity and of the large availability of LP commercial packages (i.e. Simplex algorithm). Unfortunately, the numerical efficiency of the S.L.P. method depends meaningfully on a proper choice of the move limits that are adopted for the optimisation variables. In this paper the effect on the numerical solution of different move limits definition criteria has been investigated. Two different approaches (CGML and LEAML) for the definition of the move limits in Sequential Linear Programming are described and compared in terms of numerical efficiency in the solution of six problems of weight minimisation of bar trusses structures.