Raymond B. answered 08/21/23
Math, microeconomics or criminal justice
this is a linear programming problem
with an objective function subject to constraints
graph the constraints, then check each vertex of the shaded area that satisfies all the constraints
pick the vertex which maximizes the objective function value
constraints
.55a +.75b =/> .7
.02a +.07b </= .06
63a +124b </= 132
a,b >/= 0
objective function
maximize 80a +90b