Consider the following problem.

Maximize Z = 2x₁ +3x₂,

Subject to

and

x₁ ≥ 0, x₂ ≥ 0.

(a) Solve this problem graphically. Identify the CPF solutions by circling them on the graph.

(b) Develop a table giving each of the CPF solutions and the corresponding defining equations, BF solution, and nonbasic variables. Calculate Z for each of these solutions, and use just this information to identify the optimal solution.

(c) Develop the corresponding table for the corner-point infeasible solutions, etc. Also identify the sets of defining equations and nonbasic variables that do not yield a solution.

Transcribed Image Text:

4x1-x2 10