|
Revision 3, 0.5 KB
(checked in by mirko, 5 years ago)
|
|
Knapsack sample
|
| Line | |
|---|
| 1 | /* number of items */ |
|---|
| 2 | param n, integer, >0; |
|---|
| 3 | /* items */ |
|---|
| 4 | set I := 1..n; |
|---|
| 5 | /* item weights */ |
|---|
| 6 | param weights{i in I}, integer, >0; |
|---|
| 7 | /* item sizes */ |
|---|
| 8 | param sizes{i in I}, integer, >0; |
|---|
| 9 | /* knapsack size */ |
|---|
| 10 | param capacity, integer, >0; |
|---|
| 11 | |
|---|
| 12 | var usage {i in I} binary; |
|---|
| 13 | |
|---|
| 14 | maximize total_weight: sum{i in I} usage[i]*weights[i]; |
|---|
| 15 | |
|---|
| 16 | subject to max_size: sum {i in I} usage[i]*sizes[i] <= capacity; |
|---|
| 17 | |
|---|
| 18 | solve; |
|---|
| 19 | |
|---|
| 20 | # Print the solution |
|---|
| 21 | for {i in I} printf " %i\n", usage[i]; |
|---|
| 22 | printf "\n"; |
|---|
| 23 | printf "optimum: %i\n", sum {i in I} usage[i] * weights[i]; |
|---|
| 24 | |
|---|
| 25 | end; |
|---|