Solution of a truss topology bilevel programming problem by means of an inexact restoration method
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.
Gespeichert in:
Veröffentlicht in: | Computational & applied mathematics 2011, Vol.30 (1), p.109-125 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | por |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 1807-0302 |
DOI: | 10.1590/S1807-03022011000100006 |