I am new in optimization and will appriciate if someone can assist in writing a code for this specific problem:
There are 20 vectors at length of 4
for example a=[2 6 3 7] ; b=[4 6 1 5] ; c=[3 5 7 6] etc…
I need to find a combination of minimun number of vectors that summing them will result in a vector that each number in it will be larger than 60.
For example. sum=a+c+d+e+f+g+r+z
sum(1)>60 , sum(2)>60 , sum(3)>60 and sum(4)>60
what if I need only 3 numbers (out of the 4) in the resulted vector to be lerger than 60?
Thanks
Best Answer