Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
select the i-th batsman else 0. Similarly bi, ci and di for the other 3 types of players. Then our optimization function is: X = a1*v(A1) + a2*v(A2) + … + b1*v(B1) + b2*v(B2) + … + c1*v(C1) + … + d1*v(D1) + … and so on. Our goal is to maximize X. But we also have the following constraints: