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:	binary programming Buckling eigenvalue Exact sciences and technology Fundamental areas of phenomenology (including applications) Mathematics Methods of scientific computing (including symbolic computation, algebraic computation) Numerical analysis. Scientific computation Physics Sciences and techniques of general use Solid mechanics Static elasticity (thermoelasticity...) Structural and continuum mechanics structural optimization topology optimization Geometrical shape High performance Stiffness matrix Constraint structural optimization Minimization Topology Distributed computing Modeling Weight Constrained optimization Finite element method Zero one programming binary programming Eigenvalue problem topology optimization Buckling eigenvalue Structural analysis
ISSN:	0029-5981, 1097-0207
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!