Quetion 3-Optimization
Quetion 3-Optimization
Quetion 3-Optimization
:Decomposition Method
If we have four parameter X1, X2, X3, X4. we take the first
parameter X1, X2 then we have iteration of X1 & X2 and we find
. the optimum solution on X1 & X2
Then we take the variable X3, X4 and have iteration for
. this parameters and find the optimum solution of X3 & X4
We have four values of X1, X2, X3, X4. then the iteration
for these four values to find the optimum solution this method
called Decomposition Method
The number of the needed cases of calculation is here
reduced by division of the set of task. The bicriteria
optimization problem. From each of these problems is pointed
preferable solution. The preferable solution is chosen on the
basis of minimization of a scalar global function, where are
.applied assumed weight coefficients
X4
X1
Area
X3
X2
K'x'=Q'.(2-1)
i V
K V
N
N 1
3
2
L
Fig1.1
EA/L -EA/L 1 1 v N
v N 0 1- 0 1
0 0 0 0 0 0
k'=EA/L , x'= , Q'= (2.3)
v N 0 0 0 0
0 0 0 0 0 0
S2 Vk=V1
U2
Z2
U1
S1
S2 V
U2
U1
Z1
S1
Fig2.2
Each component of displacements and reactions of the ends
of the bar inclined by angle to the axis of local coordinate
:system z may be calculated
x'=Tx Q'=TQ(2.4)
c s 0 0 u1 S1
s c 0 0 u2 S2 -
k=EA/L , x= , Q= (2.5)
c s u1 S1 0 0
s c u2 k S2 k - 0 0
Kx=Q ..(2.6)
where was used well known matrices relation I=T-1 T and was
:denoted
def
-1 ,
k=T K'T (2.7)
c -s 0 0
s c 0 0
=TT
c -s 0 0
s c 0 0
d=dv3= d=dv3=
T=-T3 T=-T3
Tk=T3
Tk=T3
3 2
Fig 2.3
M2
Q'= , x'= (2.9)
T3 w
M2 k k
K (2.10) =
Q'=K'x', (2.11)
where
T3 u
T w
M2
Q'= , x'= (2.12)
T3 u
T w
M2 k k
EA/l 0 0 : EA/l 0 0
EA/l 0 0 : EA/l 0 0-
Here
Q'=K'x' .(2.14)
where
T2
M3
Q'= , x'= (2.15)
T2
M3 k k
K (2.16) =
T3 u
T w
M2
Q'= , x'= (2.18)
T3 u
T w
M2 k k
EA/l 0 0 : EA/l 0 0
EA/l 0 0 : EA/l 0 0-
T1 u
T2 v
T3 w
M1 1
M2 2
M3 3
x'= .. x'= (2.21)
T1 u
T2 v
T3 w
M1 1
M2 2
M3 k 3k