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...

Full description

Saved in:
Bibliographic Details
Published in:International journal for numerical methods in engineering Vol. 92; no. 12; pp. 1026 - 1043
Main Authors: Browne, P. A., Budd, C., Gould, N. I. M., Kim, H. A., Scott, J. A.
Format: Journal Article
Language:English
Published: Chichester Blackwell Publishing Ltd 21.12.2012
Wiley
Wiley Subscription Services, Inc
Subjects:
ISSN:0029-5981, 1097-0207
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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