How to solve multiple choice knapsack problem (MCKP) with MATLAB?

This is a multiple choice knapsack problem. There are 8 groups and each group has 6 items. At most one item can be selected from every group such that the total value of items is maximized, while the total weight does not exceed the capacity of the knapsack W (W=50).

weight matrix w=[3 4 8 7 9 6; 7 3 12 6 2 3; 6 4 6 2 5 8; 5 6 15 5 6 13; 4 9 7 7 8 12; 6 8 9 11 11 7; 7 1 5 9 5 7; 9 5 4 10 8 6];

value matrix v=[12 9 3 5 1 5； 4 14 9 7 7 8； 9 6 10 2 10 6； 7 12 8 9 3 5； 12 3 7 12 9 12； 11 2 3 3 8 12； 5 1 6 6 3 8； 10 6 9 12 15 3];

How can I solve this problem using dynamic programming by MATLAB?

[Basem Mamdoh]

Did you solve this problem in Matlab?

kindly send it to me if you solve

[e-mail]

[Qasem Abu Al-Haija]

Greetings guys

if you get this code please send it to me as i really need it asap

[e-mail]

kind regards

Qasem

Answer 1

[L L]

I would also appreciate it, if you have it!

Thanks in advance! (<mailto:[e-mail] [e-mail]>)

[Qasem Abu Al-Haija]

Greetings guys

if you get this code please send it to me as i really need it asap

[e-mail]

kind regards

Qasem