We formulate a truss topology optimization problem as a bilevel programming problem and solve it by means of a line search type inexact restoration algorithm. We discuss details of the implementation and show results of numerical experiments.
inexact restoration; bilevel programming; truss topology optimization