On the reformulation of topology optimization problems as linear or convex quadratic mixed 0–1 programs

Publication: Research - peer-reviewJournal article – Annual report year: 2007

View graph of relations

We consider equivalent reformulations of nonlinear mixed 0–1 optimization problems arising from a broad range of recent applications of topology optimization for the design of continuum structures and composite materials. We show that the considered problems can equivalently be cast as either linear or convex quadratic mixed 0–1 programs. The reformulations provide new insight into the structure of the problems and may provide a foundation for the development of new methods and heuristics for solving topology optimization problems. The applications considered are maximum stiffness design of structures subjected to static or periodic loads, design of composite materials with prescribed homogenized properties using the inverse homogenization approach, optimization of fluids in Stokes flow, design of band gap structures, and multi-physics problems involving coupled steady-state heat conduction and linear elasticity. Several numerical examples of maximum stiffness design of truss structures are presented.
Original languageEnglish
JournalOptimization and Engineering
Publication date2007
Volume8
Issue2
Pages163-192
ISSN1389-4420
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 4

Keywords

  • Convex mixed integer programming, Topology optimization
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 2691500