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

摘要: Abstract A variety of numerical methods have been proposed in literature purpose to deal with the complexity and non-linearity structural optimization problems. In practical design, sequential linear programming (SLP) is very popular because its inherent simplicity solvers (e.g. Simplex) are easily available. However, SLP performance sensitive definition proper move limits for design variables which task itself often involves considerable heuristics. This research presents a new algorithm (LESLP––linearization error programming) that implements an advanced technique defining limits. The LESLP formulated so overcome traditional limitations method. successfully tested weight minimization problems truss structures up hundreds thousands constraints: sizing configuration considered. Optimization non-truss also presented. key-ideas discussion on efficiency presented two-part paper. first part concerns basics formulation provides potential users guide computers. companion paper, efficiency, advantages drawbacks discussed compared those other algorithms recently published or implemented commercial software packages.