Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
customer j has some “value” to the company denoted by v(j). Total budget for discount coupons is W. Each customer can be given at-most one coupon. Each coupon should be given to at-most one customer. Solution: Let h_ij = 1 if the i-th coupon is given to the j-th customer else 0, then the total