Topology design of structures using a dual algorithm and a constraint on the perimeter

Dual optimization algorithms are well suited for the topology design of continuum structures in discrete variables, since in these problems the number of constraints is small in comparison to the number of design variables. The ‘raw’ dual algorithm which was originally proposed for the minimum compliance design problem, worked well when a perimeter constraint was added in addition to the volume constraint. However, if the perimeter constraint was gradually relaxed by increasing the upper bound on the allowable perimeter, the algorithm tended to behave erratically. Recently, a simple strategy has been suggested which modi es the raw dual algorithm to make it more robust in the absence of the perimeter constraint; in particular the problem of checkerboarding which is frequently observed with the use of lower-order nite elements is eliminated. In this work, we show how the perimeter constraint can be incorporated in this improved algorithm, so that it not only provides a designer with a control over the topology, but also generates good topologies irrespective of the value of the upper bound on the perimeter