- Manfaat metode Greedy
- Mencari Profit terbesar
- Membatasi kapasitas bawaan
- Mencari cara yg paling efektif dan efesien
- Meminimalkan barang bawaan
- Membuat profit lebih banyak
- (10, 3, 9, 12, 20, 7, 11)
Ordering (3, 1, 2, 4, 5, 6, 7)
D ( I ) 9 + (9+10) + (9+10+3) + (9+10+3+12) + ((9+10+3+12+20) = 271
- a) M = 80 Pi = max
W1 = 50 P1 = 100 → X1 = 1
W2 = 60 P2 = 80 → X2 = ?
W3 = 70 P3 = 90 → X3 = 0
50.1 + 60. X2 + 70.0 = 80
60. X2 = 80 – 50 = 30
X2 = 30 = 1
60 2
b) Wi min
W1 = 50 → X1 = 0
W2 = 60 → X2 = ?
W3 = 70 → X3 = 1
50.0 + 60.X2 + 70.1 = 80
60.X2 = 80 – 70 = 10
X2 = 10 = 1
60 6
c) Pi / Wi max
P1/W1 = 100/50 = 2 → X1 = 0
P2/W2 = 80/60 = 1,3 → X2 = 1
P3/W3 = 90/70 = 1,28 → X3 = ?
50.0 + 60.1 + 70. X3 = 80
70. X3= 80 – 60 = 20
X3 = 20 = 2
70 7
(X1, X2, X3)
(1, ½, 0)
(0, 1/6, 1)
(0, 1, 2/7)
∑ Wi.Xi
1. 50.1 + 60.1/2 + 70.0 = 50 + 30 = 80
2. 50.0 + 60.1/6 + 70.1 = 10 + 70 = 80
3. 50.0 + 60.1 + 70.2/7 = 60 + 20 = 80
∑ Pi.Pi
1. 100.1 + 80.1/2 + 90.0 = 100 + 40 = 140
2. 100.0 + 80.1/6 + 90.1 = 90 + 13,3 = 103.3
3. 100.0 + 80.1 + 90.2/7 = 80 + 25,7 = 105,7
4. Fungsi tujuan max
∑ = n/2. Pi.Xi
Fungsi pembatas
n/2. Wi.Xi ≤ M
Tidak ada komentar:
Posting Komentar