Pulp, Python Programming, Linear Programming, Application, Snippet.
obtain the highest possible profit. Solve: # from pulp import * prob=LpProblem('apol_q4', LpMaximize) x1=LpVariable("outerwear", 0) x2=LpVariable("pants", 0) prob += 123*x1+98*x2 prob += 2*x1+1.5*x2<=1000 prob += x1<=300 prob += x2<=400 prob.solve() for v in prob.variables(): print(v.name,"=",