A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constants

ePubs

The open archive for STFC research publications

DOI	10.5286/raltr.2011022
Persistent URL	http://purl.org/net/epubs/work/61351
Record Status	Checked
Record Id	61351
Title	A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constants
Contributors	PA Browne, CJ Budd, NIM Gould (STFC Rutherford Appleton Lab.), HA Kim, JA Scott (STFC Rutherford Appleton Lab.)
Abstract	We present a method for fnding 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 minimisation 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.
Organisation	CSE , CSE-NAG , STFC
Keywords
Funding Information
Related Research Object(s):
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Report	RAL Technical Reports RAL-TR-2011-022. 2011.		RAL-TR-2011-022.pdf	2011