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

P. A. Browne; C. Budd; N. I. M. Gould; H. A. Kim; J. A. Scott

doi:10.1002/nme.4367

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

P. A. Browne, C. Budd, N. I. M. Gould, H. A. Kim, J. A. Scott

Research output: Contribution to journal › Article › peer-review

22 Citations (SciVal)

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

Original language	English
Pages (from-to)	1026-1043
Number of pages	18
Journal	International Journal for Numerical Methods in Engineering
Volume	92
Issue number	12
DOIs	https://doi.org/10.1002/nme.4367
Publication status	Published - 21 Dec 2012

Access to Document

10.1002/nme.4367

Cite this

@article{15a454c8af174a6cad9463d184c14bc5,

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

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",

author = "Browne, {P. A.} and C. Budd and Gould, {N. I. M.} and Kim, {H. A.} and Scott, {J. A.}",

year = "2012",

month = dec,

day = "21",

doi = "10.1002/nme.4367",

language = "English",

volume = "92",

pages = "1026--1043",

journal = "International Journal for Numerical Methods in Engineering",

issn = "0029-5981",

publisher = "John Wiley and Sons Inc.",

number = "12",

}

TY - JOUR

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

AU - Browne, P. A.

AU - Budd, C.

AU - Gould, N. I. M.

AU - Kim, H. A.

AU - Scott, J. A.

PY - 2012/12/21

Y1 - 2012/12/21

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

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

UR - http://www.scopus.com/inward/record.url?scp=84869883024&partnerID=8YFLogxK

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

U2 - 10.1002/nme.4367

DO - 10.1002/nme.4367

M3 - Article

SN - 0029-5981

VL - 92

SP - 1026

EP - 1043

JO - International Journal for Numerical Methods in Engineering

JF - International Journal for Numerical Methods in Engineering

IS - 12

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this