What is the best way to constrain the conditions below.
Arrays x and y are sized dynamically and each value is rangebound. The sum of products of array x and y should be less than a certain value. X[i]Y[i] + X[i+1]Y[i+1] + ... < Val
I know I can create another array Z which can hold the product such as Z[i]=X[i]Y[i} etc and then apply Z.sum to < Val.
However, is there a more efficient single line solution to SoP?