Computer and Structures - Requested Paper

[melkat]

Move limits definition in structural optimization with sequential linear programming. Part I: Optimization algorithm

Author: Luciano Lamberti & Carmine Pappalettere | Size: 329 KB | Format: PDF | Quality: Unspecified | Publisher: Computers and Structures (81) | Year: 2003 | pages: 197-213

A variety of numerical methods have been proposed in literature in purpose to deal with the complexity and nonlinearity of structural optimization problems. In practical design, sequential linear programming (SLP) is very popular because of its inherent simplicity and because linear solvers (e.g. Simplex) are easily available. However, SLP performance is sensitive to the definition of proper move limits for the design variables which task itself often involves considerable heuristics. This research presents a new SLP algorithm (LESLP––linearization error sequential linear programming) that implements an advanced technique for defining the move limits. The LESLP algorithm is formulated so to overcome the traditional limitations of the SLP method. The new algorithm is successfully tested in weight minimization problems of truss structures with up to hundreds of design variables and thousands of constraints: sizing and configuration problems are considered. Optimization problems of non-truss structures are also presented.

Code:

***************************************
Content of this section is hidden, You must be registered and activate your account to see this content. See this link to read how you can remove this limitation:

http://forum.civilea.com/thread-27464.html
***************************************

This post has been made by CivilEA Post-Generator ver 2.1.6