Seminar Prof - Daniel
Seminar Prof - Daniel
Optimasi
Prof. Ir. Daniel Mohammad Rosyid, Ph. D
4313100017
Faatih Raabbaniy
4313100027
4313100048
Yossy Kurnia .S
4313100071
4313100111
M. Arif Hidayatullah
4313100137
Pemecahan Masalah
Menggunakan 2 Metode yaitu
Direct dan Indirect Method
Pertanyaan
Indirect Method
Masukkan ke rumus
Mencari
Nilai Maksimum
L=0
yang diberikan
Misal :
1
=0
=0
+H=0
=-H
D = - H (tidak memenuhi karena H 2D)
Misal
=0
:
,
=0
H 2D = 0
H = 2D
+ - 22 = 0
+ 2 = 22
2
D=
=0
2
=-
D=
2 =
=3D = -2D
(Tidak Memenuhi)
D=D
=22 = -32
(Tidak Memenuhi)
Misal
k1 = 0 ,
2 = 0
=0
= -
D = - 2.71442
Misal :
k1 = 0 ,
k2 = 0
H 2D = 0
H
= 2D
= 2.3355 dm
= 2D
= 2 (2.3355)
= 4.671 dm
Menentukan lamda
D = 2.3355 dm
H = 4.671 dm
=
2(22 - + ) (H)
(22 - + ) (H)
4( +
=
((22 - + )) (4.671) = ( +
(9.342
) (2)
2( +
2
) ()
)) ()
+ 34.2546) =
(34.2546 + 4.671 2)
Direct Search
- 20 0
G H 2D 0
Z
Xi+1 = Xi + d
Di+1 = Di + d
Hi+1 = Hi + d
; di = -i
=
D
i 3 dm
ri = 1
Hi = 6.053 dm
i = 0.0045
= 2.764386 dm
) + (6.053)()(3) 1 ( + ))
= 5.817386 dm
D
i = 2.764386 dm
ri = 0.5
Hi = 5.817386 dm
) + (6.053)()(3) 0.5 ( + ))
= 2.57288 dm
) + (6.053)()(3) 0.5 ( + ))
= 5.62588 dm
>> sampai dengan iterasi ke-35
D = 2.202156 dm
H = 5.255156 dm