A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

    Abstract

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities) and cuts.
    Original languageEnglish
    Title of host publication7th World Congress on Structural and Multidisciplinary Optimization : Proceedings
    Publication date2007
    Pages2513-2522
    Publication statusPublished - 2007
    Event7th World Congress on Structural and Multidisciplinary Optimization - Seoul, Korea, Republic of
    Duration: 21 May 200725 May 2007
    Conference number: 7
    http://www.ndaportal.com/wcsmo-7.html

    Conference

    Conference7th World Congress on Structural and Multidisciplinary Optimization
    Number7
    CountryKorea, Republic of
    CitySeoul
    Period21/05/200725/05/2007
    Internet address

    Keywords

    • Topology optimization
    • Branch and cut
    • Global optimality

    Fingerprint Dive into the research topics of 'A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality'. Together they form a unique fingerprint.

    Cite this