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

Citation
L. Lamberti et C. Pappalettere, Comparison of the numerical efficiency of different sequential linear programming based algorithms for structural optimisation problems, COMPUT STRU, 76(6), 2000, pp. 713-728
Citations number
19
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Civil Engineering
Journal title
COMPUTERS & STRUCTURES
ISSN journal
0045-7949 → ACNP
Volume
76
Issue
6
Year of publication
2000
Pages
713 - 728
Database
ISI
SICI code
0045-7949(200007)76:6<713:COTNEO>2.0.ZU;2-S
Abstract
Amongst the different optimisation methods, the Sequential Linear Programmi ng (S.L.P.) is very popular because of its conceptual simplicity and of the large availability of LP commercial packages (i,e. Simplex algorithm). Unf ortunately, the numerical efficiency of the S.L.P. method depends meaningfu lly on a proper choice of the move limits that are adopted for the optimisa tion 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 Progr amming are described and compared in terms of numerical efficiency in the s olution of six problems of weight minimisation of bar trusses structures. ( C) 2000 Elsevier Science Ltd, All rights reserved.