Research

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


Reference:

Browne, P. A., Budd, C., Gould, N. I. M., Kim, H. A. and Scott, J. A., 2012. A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints. International Journal for Numerical Methods in Engineering, 92 (12), pp. 1026-1043.

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below. (Contact Author)

Official URL:

http://dx.doi.org/10.1002/nme.4367

Abstract

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

Details

Item Type Articles
CreatorsBrowne, P. A., Budd, C., Gould, N. I. M., Kim, H. A. and Scott, J. A.
DOI10.1002/nme.4367
DepartmentsFaculty of Science > Mathematical Sciences
Faculty of Engineering & Design > Mechanical Engineering
Research CentresAerospace Engineering Research Centre
RefereedYes
StatusPublished
ID Code30658

Export

Actions (login required)

View Item