# "Multi-Knapsack" problem # ILOG Planner 0.9 User's Manual, pp 10-11 param m integer > 0; param n integer > 0; param a {1..m,1..n} >= 0; param b {1..m} >= 0; param c {1..n} >= 0; var x {1..n} integer >= 0; maximize Objective: sum {j in 1..n} c[j] * x[j]; subj to Constraint {i in 1..m}: sum {j in 1..n} a[i,j] * x[j] <= b[i]; data; param m := 7; param n := 12; param a: 1 2 3 4 5 6 7 8 9 10 11 12 := 1 1 1 1 1 1 1 1 1 1 1 1 1 2 0 4 5 0 0 0 0 4 5 0 0 0 3 4 0 3 0 0 0 3 0 4 0 0 0 4 7 0 0 6 0 0 7 0 0 6 0 0 5 0 0 0 4 5 0 0 0 0 5 4 0 6 0 0 0 0 4 3 0 0 0 0 4 3 7 0 3 0 0 0 5 0 3 0 0 0 6 ; param b := 1 13 2 17 3 20 4 34 5 26 6 16 7 16 ; param c := 1 5 2 7 3 5 4 11 5 8 6 10 7 6 8 8 9 3 10 12 11 9 12 10 ;