01 Knapsack Problem Using
01 Knapsack Problem Using
USING FIFO
2 3
U= -10+-15=-25 C=-29 C=-27
U=-25 U=-21
GLOBAL UPPER BOUND (U^)=-25
4 5 6 7
C=-29 C=-26 C=-27
U=-25 U=-24 U=-21
C=-18
X3=1 X3=0 X3=1 X3=0 X3=1 X3=0 U=-18
lower bound >
global upper
8 9 10 11 12 13
C=-29 bound
U=-25 kill the node
14 15
C=-29
U=-29 COMPARE GLOBAL UPPER BOUND WITH UPPER BOUND OF EACH
NODE, UPDATE GLOBAL UPPER BOUND IF U<U^
sum of objects>
m=12 X5=1 X5=0
kill the node
IF GLOBAL UPPER BOUND<LOWER BOUND, THEN KILL NODE
16 17
convert minimization problem into maximization problem by changing -ve
profit sign to +ve sign
C=-29 C=-25 max profit = 10 + 15 + 4
U=-29 U=-25 = 25