Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
value is: X = h_11*v(1)+h_12*v(2)+…+h1m*v(m)+h_21*v(1)+h_22*v(2)+…+h_nm*v(m) Our goal is to maximize the total value X under the following constraints: h_11*p(1)+h_12*p(1)+…+h1m*p(1)+h_21*p(2)+p_22*p(2)+…+h_nm*p(n) ≤ W h_i1+h_i2+…+h_im ≤ 1 for all i=1 to n (each coupon given to at-most one