Consider the following problem. Maximize Z = 2x1 + x2 subject to 3x1 + x2 ≤ 8 x1 + x2 ≤ 4 x1, x2 ≥ 0 (a) (points: 3) Use graphic method to identify all the corner-point solutions for this model. Label each as either feasible or infeasible.
(b) (points: 3) Calculate the value of the objective function for each of the CFP solutions. Use this information to identify an optimal solution.
(c) (points: 2) Identify the sequence of CFP solutions that might be examined by the simplex method to reach an optimal solution. (Hint: There are two possible solutions for this particular model. Suffices to identify just one.)