Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
total satisfaction under the following constraints. h_i1+h_i2+…+h_im = 1 for all i=1 to n (all tasks should be assigned) How to handle the constraint with the story points since it is not possible to define what “roughly equal” means. If we define strict equality or criteria on maximum variance