2
Langkah Pertama Langka h Kedua Solusi Optimal Model Site 1 Site 2 Site 3 Mode l d1 = 0 1 2 3 4 F1(x1) d1 0 4 3 3 0 11 11 4 1 7 6 7 1 9 9 3 2 8 10 8 2 8 8 2 3 9 12 13 3 7 7 1 4 11 14 15 4 0 0 0 Langkah Ketiga Solusi Optimal Langk ah Ketig a Solus i Optim al Model d1 = 0 1 2 3 4 F1(x1 ) d1 Model d1 = 0 1 2 3 4 F1(x1 ) d1 X2 0 6 10 12 14 X3 0 6 10 12 14 0 11+0=11 6+9=15 10+8 =18 12+7=19 14+0=14 19 3 0 11+0=11 6+9=15 10+8 =18 12+7=19 14+0 19 3 1 9+0=9 6+8=14 10+7 =17 12+0=12 17 2 1 9+0=9 6+8=14 10+7 =17 12+0=12 17 2 2 8+0 =8 6+7=13 10+0=10 13 1 2 8+0 =8 6+7=13 10+0 13 1 3 7+0 = 7 6+0=6 7 0 3 7+0 = 7 6+0=6 7 0 4 0 0 0 4 0 0 0

Dinamik Programing.docx

Embed Size (px)

Citation preview

Langkah PertamaLangkah KeduaSolusi Optimal

Model Site 1Site 2Site 3Model d1 = 01234F1(x1)d1

0433011114

17671993

281082882

3912133771

41114154000

Langkah KetigaSolusi OptimalLangkah KetigaSolusi Optimal

Model d1 = 01234F1(x1)d1Model d1 = 01234F1(x1)d1

X206101214X306101214

011+0=116+9=1510+8 =1812+7=1914+0=14193011+0=116+9=1510+8 =1812+7=1914+0193

19+0=96+8=1410+7 =1712+0=1217219+0=96+8=1410+7 =1712+0=12172

28+0 =86+7=1310+0=1013128+0 =86+7=1310+0131

37+0 = 76+0=67037+0 = 76+0=670

40004000

Langkah KetigaSolusi Optimal

Model d1 = 01234F1(x1)d1

X40781315

0+19 =197+17=248+13=2113+7=2015+0=15241