On the use of bilevel programming for solving a structural optimization problem with discrete variables

• Type: Article in International Scientific Journal
• Date: 2006

Journal

Title: Springer Optimization and Its Applications

Vol. 138

Pages: 123-142

ISSN: 1931-6828

Publisher: Springer Nature

Other information

Authenticus ID: P-005-4PK

DOI: 10.1007/0-387-34221-4

Abstract (EN): In this paper, a bilevel formulation of a structural optimization problem with discrete variables is investigated. The bilevel programming problem is transformed into a Mathematical Program with Equilibrium (or Complementarity) Constraints (MPEC) by exploiting the Karush-Kuhn-Tucker conditions of the follower's problem. A complementarity active-set algorithm for finding a stationary point of the corresponding MPEC and a sequential complementarity algorithm for computing a global minimum for the MPEC are analyzed. Numerical results with a number of structural problems indicate that the active-set method provides in general a structure that is quite close to the optimal one in a small amount of effort. Furthermore the sequential complementarity method is able to find optimal structures in all the instances and compares favorably with a commercial integer program code for the same purpose.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 20