Philip P. answered 04/03/18
Tutor
4.9
(484)
Affordable, Experienced, and Patient Algebra Tutor
This is a linear programming problem. Let x = the number of notebooks and y = the number of laptops. The function to be optimized is the profit:
Profit = 70x + 110y
Your constraints on labor and materials are:
40x + 50y ≤ 1350
50x + 50y ≤ 1150
x ≥ 0
y ≥ 0
Graph the 4 inequalities. The feasible zone - the section of the coordinate plane that contains solutions to all of the inequalities - is the region bounded by the inequalities. The maximum profit lies at one of the vertices on the outside border. Note the (x,y) coordinates of each vertex, then plug them into the Profit equation. The (x,y) pair that gives the highest profit is the answer.