Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
allocated to only one executive All orders should be assigned. Each executive is assigned at-most 2 orders. Solution: Let h_ij = 1 if the i-th order is assigned to the j-th executive else 0, then the total cost is: X = h_11*C_11+h_12*C_12+…+h1m*C_1m+h_21*C_21+h_22*C_22+…+h_nm*C_nm Our goal is to