SOLUTION OF THE LARGE MINIMUM COMPLIANCE PROBLEM USING BILEVEL OPTIMIZATION

DOI:

https://doi.org/10.24297/jam.v12i2.556

Keywords:

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

Download data is not yet available.

Downloads

Published

2016-04-15

How to Cite

SOLUTION OF THE LARGE MINIMUM COMPLIANCE PROBLEM USING BILEVEL OPTIMIZATION. (2016). JOURNAL OF ADVANCES IN MATHEMATICS, 12(2), 5928–5937. https://doi.org/10.24297/jam.v12i2.556

Issue

Section

Articles