返回
Move limits definition in structural optimization with sequential linear programming. Part II: Numerical examples
DOI:10.1016/S0045-7949(02)00443-1.png)
摘要
En 中文
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) that implements an advanced technique for defining the move limits. The linearization error sequential linear programming (LESLP) algorithm is formulated so to overcome the traditional limitations of the SLP method. In a companion paper [Comput. Struct. 81 (2003) 1971 the basics of the LESLP formulation along with a guide to programming are provided. The new algorithm is successfully tested in weight minimisation 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. The numerical efficiency, advantages and drawbacks of LESLP are discussed and compared to those of other SLP algorithms recently published or implemented in commercial software packages. (C) 2003 Elsevier Science Ltd. All rights reserved.
Keyword:
SLP
move limits
linearization error
trust region
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.8
论文数:
6.2K
被引数:
1.7W
机构
暂无机构信息
引用论文
Work system design in macroergonomics: A case study related to prioritization of major sociotechnical system components by using the fuzzy analytic network process宏观工效学中的工作系统设计:一项关于利用模糊网络分析法对主要社会技术系统组件进行优先级排序的案例研究

