SOLUTION OF THE LARGE MINIMUM COMPLIANCE PROBLEM USING BILEVEL OPTIMIZATION
DOI:
https://doi.org/10.24297/jam.v12i2.556Keywords:
Topology optimization, subdomains method, parallel computing, bilevel optimization, Karush-Kuhn-Tucker conditions.Abstract
The topology optimization problem have a great industrial interest. Using the subdomains method, we have formulated the decomposed topology optimization problem as a bilevel one. In this paper, we reformulate our bilevel problem as a single level optimization problem by replacing the lower level optimization problem with its KKT optimality conditions, we give also a new algorithm and numerical results.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
All articles published in Journal of Advances in Linguistics are licensed under a Creative Commons Attribution 4.0 International License.