You are asked to solve the following Linear Programming (LP) problem. Objective: Maximize \( 1.50…

You are asked to solve the following Linear Programming (LP) problem.
Objective: Maximize \( 1.50 \mathrm{~A}+3.00 \mathrm{~B} \),
Subject to the following constraints:
\( 3 \mathrm{~A}+2 \mathrm{~B} \leq 600 \)
\( 2 \mathrm{~A}+4 \mathrm{~B} \leq 600 \)
\( \mathrm{A}+3 \mathrm{~B} \leq 420 \)
\( \mathrm{A} \geq 0 \)
\( \mathrm{B} \geq 0 \)
a. (15 points)
Graphical Solution – Plot the constraints on the grid provided below.
Clearly identify the feasible region and label its corner points.
Show all calculations and explain how you identified the feasible region and corner points.
Once you complete the graph, copy and paste it as a screenshot (using PrintScreen) into your report.
b. (20 points)
Analytical Solution – Calculate and report the optimal product mix (i.e., values of A and B ) that maximizes the objective function.
Clearly explain how you arrived at this solution.
e. (15 points)
Excel Solver Solution – Reproduce this problem in Excel and solve it using Excel’s Solver.
Include two printouts as exhibits at the end of your report:
The Excel Solver Sheet showing your model setup and solution.
The Solver Answer Report generated by Excel. (You may insert screenshots using PrintScreen).