Consider the following model:

Maximize Profit = 2x1 + x2,

subject to

3x1 + x2 15

x1 + 2x2 10

and

x1 0, x2 0.

You are given that its corner points are (0, 0), (5, 0), (4, 3), and (0, 5).

a. Use the enumeration-of-corner-points method to solve the model.

b. Use the information developed in part a to identify the path that the graphical simplex method would follow to solve the model.

c. Convert the functional constraints into equations by introducing slack variables.

d. Identify all the basic feasible solutions for the problem with slack variables. For each such solution, identify both the nonbasic variables and the basic variables.

e. What is the sequence of basic feasible solutions obtained by the simplex method when following the path identified in part b?