A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints
SUMMARY We present a method for finding solutions of large‐scale binary programming problems where the calculation of derivatives is very expensive. We then apply this method to a topology optimization problem of weight minimization subject to compliance and buckling constraints. We derive an analyt...
Gespeichert in:
| Veröffentlicht in: | International journal for numerical methods in engineering Jg. 92; H. 12; S. 1026 - 1043 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Chichester
Blackwell Publishing Ltd
21.12.2012
Wiley Wiley Subscription Services, Inc |
| Schlagworte: | |
| ISSN: | 0029-5981, 1097-0207 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | SUMMARY
We present a method for finding solutions of large‐scale binary programming problems where the calculation of derivatives is very expensive. We then apply this method to a topology optimization problem of weight minimization subject to compliance and buckling constraints. We derive an analytic expression for the derivative of the stress stiffness matrix with respect to the density of an element in the finite‐element setting. Results are presented for a number of two‐dimensional test problems.Copyright © 2012 John Wiley & Sons, Ltd. |
|---|---|
| Bibliographie: | ark:/67375/WNG-WWF9RS5M-S ArticleID:NME4367 EPSRC - No. EP/E053351/1 istex:0A5059919A6DABA57C8B7295DBA5D5D13219E799 ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| ISSN: | 0029-5981 1097-0207 |
| DOI: | 10.1002/nme.4367 |