论文信息 - Topology optimization by sequential integer linear programming

Topology optimization by sequential integer linear programming

We present a new iterative approach for topology optimization of load-carrying structures. In each iteration an integer linear programming problem is generated and solved. The method is guaranteed to find a local optimum of the original problem, but not necessarily a global optimum. Numerical results for some stress constrained problems are presented.

Krister Svanberg | Mats Werme | K. Svanberg | M. Werme

[1] M. Zhou,et al. Generalized shape optimization without homogenization , 1992 .

[2] Krister Svanberg,et al. A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations , 2002, SIAM J. Optim..

[3] V. Braibant,et al. Structural optimization: A new dual method using mixed variables , 1986 .

[4] M. Bendsøe. Optimal shape design as a material distribution problem , 1989 .

[5] R. E. Griffith,et al. A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems , 1961 .

[6] K. Svanberg. The method of moving asymptotes—a new method for structural optimization , 1987 .

[7] M. Bendsøe,et al. Material interpolation schemes in topology optimization , 1999 .

[8] Claude Fleury,et al. CONLIN: An efficient dual optimizer based on convex approximation concepts , 1989 .

[9] S. Nash,et al. Linear and Nonlinear Programming , 1987 .

[10] Mathias Stolpe,et al. Modelling topology optimization problems as linear mixed 0–1 programs , 2003 .

[11] Krister Svanberg,et al. Topology optimization by a neighbourhood search method based on efficient sensitivity calculations , 2006 .