You are given the following data for a linear programming problem where the objective is to maximize the profit from allocating three resources to two nonnegative activities.

(a) Formulate a linear programming model for this problem.
D

(b) Use the graphical method to solve this model.

(c) Display the model on an Excel spreadsheet.

(d) Use the spreadsheet to check the following solutions:
(x1, x2) (2, 2), (3, 3), (2, 4), (4, 2), (3, 4), (4, 3). Which of these solutions are feasible? Which of these feasible solutions has the best value of the objective function?
C

(e) Use the Excel Solver to solve the model by the simplex method.