Solution to the task i have encountered while studying Data Science MIT 6.0002 course. Task was discussed at second video lecture of course mentioned above.
Score = ((60 – (a+b+c+d+e))F + aps1 + bps2 + cps3 + dps4 + eps5 Objective: Given values for F, ps1, ps2, ps3, ps4, ps5 Find values for a, b, c, d, e that maximize score
Constraints: a, b, c, d, e are each 10 or 0 a + b + c + d + e ≥ 20
Any kind of feedback/remarks highly appreciated!