Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
minimize the total cost X under the following constraints: h_i1+h_i2+…+h_im = 1 for all i=1 to n (each order should be allocated to only one executive) h_1j+h_2j+…+h_nj ≤ 2 for all j= 1 to m (each executive is assigned at-most 2 orders) The costs C_ij can be computed based on multiple factors such