Pharmaceutical, Machine Learning, Graph Theory, Linear Programming.
solution: from pulp import * LP = LpProblem(name="Max Efficiency", sense = LpMaximize) A=LpVariable("A",0) B=LpVariable("B",0) C=LpVariable("C",0) revenue_per_hr_A = 7000 revenue_per_hr_B = 6500 revenue_per_hr_C = 6000 # Initializing variables LP += (A+B+C) <= 1 LP +=