11.02.2013 Views

Composite Materials Research Progress

Composite Materials Research Progress

Composite Materials Research Progress

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Optimization of Laminated <strong>Composite</strong> Structures… 79<br />

optimization which includes a large amount of design variables (Bruyneel and Duysinx<br />

2005). It has been made available in the BOSS Quattro optimization toolbox (Radovcic and<br />

Remouchamps, 2002). In the following this solution procedure based on a mixed<br />

approximation scheme is called Self Adaptive Method (SAM). Based on this approximation<br />

scheme, it is possible to resort to the other ones (GBMMA, MMA, Conlin and the linear<br />

approximation) by setting specific values to the asymptotes and by limiting the<br />

approximations to the sets A or B in (7.6).<br />

145<br />

140<br />

135<br />

130<br />

125<br />

120<br />

115<br />

110<br />

105<br />

100<br />

Strain energy<br />

density<br />

(N/mm)<br />

(k )<br />

L<br />

g(θ<br />

)<br />

θ<br />

(k ) *<br />

MMA<br />

g GCMMA<br />

~<br />

g MMA<br />

~<br />

(k )<br />

U<br />

45 90 (k ) 135 (k ) * 180<br />

θ θGCMMA<br />

400<br />

350<br />

300<br />

250<br />

200<br />

150<br />

g MMA<br />

~<br />

g(t<br />

)<br />

Strain energy<br />

density<br />

(N/mm)<br />

1.2 1.3 1.4 1.5 (k ) 1.7<br />

Figure 7.5. The mixed SAM approximation.<br />

t<br />

g GCMMA<br />

~<br />

(k )*<br />

GCMMA<br />

A summary of the approximations that will be compared in the following is presented in<br />

Table 7.1.<br />

Table 7.1. Summary of the approximations that will be compared in the numerical tests<br />

Approximation Author Behavior<br />

MMA Svanberg (1987) Monotonous<br />

GCMMA Svanberg (1995) Non monotonous<br />

SAM Bruyneel (2006) Mixed monotonous/non monotonous<br />

7.3. Solution Procedure for Mono and Multi-objective Optimizations<br />

Since the approximations are convex and separable the solution of each optimization subproblem<br />

(Figure 2.3) is achieved by using a dual approach. Based on the theory of the duality,<br />

solving the problem (2.2) in the space of the primal variables xi is equivalent to maximize a<br />

function (7.10) that depends on the Lagrangian multipliers λ j , also called dual variables:<br />

max minL<br />

( x, λ)<br />

λ<br />

x<br />

t<br />

(k ) *<br />

MMA<br />

0 0,...,<br />

( 0 1)<br />

=<br />

= ≥ λ<br />

λ<br />

m j j (7.10)<br />

t

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!