Repeat Prob. 4.1-4 for the following problem.
Maximize Z = x1 + 2x2,
Subject to

and
x1 ‰¥ 0, x2 ‰¥ 0.

Prob. 4.1-4

Consider the linear programming model (given in the back of the book) that was formulated for Prob. 3.2-3.

(a) Use graphical analysis to identify all the corner-point solutions for this model. Label each as either feasible or infeasible.

(b) Calculate the value of the objective function for each of the CPF solutions. Use this information to identify an optimal solution.

(c) Use the solution concepts of the simplex method given in Sec. 4.1 to identify which sequence of CPF solutions might be examined by the simplex method to reach an optimal solution. (Hint: There are two alternative sequences to be identified for this particular model.)

Transcribed Image Text:

X, + 3x, < 8 X + x2s4