Download docx - Dinamik Programing.docx

Transcript

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