An active set algorithm to handle bound constraints in structural optimization

An algorithm to handle bound constraints in structural optimization is presented. The algorithm, based on the well known Kuhn-Tucker conditions, chooses the active and passive design variables in a very efficient way, avoiding classical zig-zagging. It can be implemented in conjunction with either mathematical programming or optimality criterion methods. Some examples showing the good performance of the algorithm are presented.