Generalized Benders’ Decomposition for topology optimization problems

Generalized Benders’ Decomposition for topology optimization problems

0.00 Avg rating0 Votes
Article ID: iaor20118438
Volume: 51
Issue: 1
Start Page Number: 149
End Page Number: 183
Publication Date: Sep 2011
Journal: Journal of Global Optimization
Authors: ,
Keywords: optimization, programming: nonlinear, design
Abstract:

This article considers the non‐linear mixed 0–1 optimization problems that appear in topology optimization of load carrying structures. The main objective is to present a Generalized Benders’ Decomposition (GBD) method for solving single and multiple load minimum compliance (maximum stiffness) problems with discrete design variables to global optimality. We present the theoretical aspects of the method, including a proof of finite convergence and conditions for obtaining global optimal solutions. The method is also linked to, and compared with, an Outer‐Approximation approach and a mixed 0–1 semi definite programming formulation of the considered problem. Several ways to accelerate the method are suggested and an implementation is described. Finally, a set of truss topology optimization problems are numerically solved to global optimality.

Reviews

Required fields are marked *. Your email address will not be published.