Using the sequential linear integer programming method as a post‐processor for stress‐constrained topology optimization problems |
| |
Authors: | M Werme |
| |
Affiliation: | Optimization and Systems Theory, Department of Mathematics, KTH, Stockholm, Sweden |
| |
Abstract: | This paper deals with topology optimization of load‐carrying structures defined on discretized continuum design domains. In particular, the minimum compliance problem with stress constraints is considered. The finite element method is used to discretize the design domain into n finite elements and the design of a certain structure is represented by an n‐dimensional binary design variable vector. In order to solve the problems, the binary constraints on the design variables are initially relaxed and the problems are solved with both the method of moving asymptotes and the sparse non‐linear optimizer solvers for continuous optimization in order to compare the two solvers. By solving a sequence of problems with a sequentially lower limit on the amount of grey allowed, designs that are close to ‘black‐and‐white’ are obtained. In order to get locally optimal solutions that are purely {0, 1}n, a sequential linear integer programming method is applied as a post‐processor. Numerical results are presented for some different test problems. Copyright © 2008 John Wiley & Sons, Ltd. |
| |
Keywords: | topology optimization stress constraints 0‐1 problems post‐processing |
|
|