8 Mar
2010
8 Mar
'10
12:05 p.m.
I have 2d array of observations x1, x2, x3, x4 which I am looking to solve in such a way that z have a minimum value. ax1 + bx2 + cx3 + dx4 = s z = np.where(s < 0).shape[0] I am currently using a brute force method by putting a constraint 0 > (a,b,c,d) < 20. I am looking for ideas to acheive this more efficiently. Cheers, M