Consider the following linear programming problem P:

Maximize z = 6x₁ + 4 x₂

Subject to x₁ + x₂ 8 (1)

2x₁ -2 x₂ 8 (2)

x₁ - x₂ 2 (3)

____________________________________

x₁ 0

x₂ unconstrained in sign

Let the slack of constraint (1) and (2) be x₃ and x₄, respectively, and the surplus of constraint (3) be x₅. Answer the following independent questions: 5 What is the optimal solution if both x₁ and x₂ are unconstrained in sign?

6 What is the optimal solution, if

(i) constraint (3) is removed from the formulation?

.

(ii) constraint (2) is removed from the formulation?

7 Construct the initial basic solution by adding artificial variables and making the necessary variable transformations so that you can apply the Big-M method to Problem P. Set up the iteration (0) tableau. Indicate the entering and leaving variable and perform a single iteration. Write the resulting basic solution of iteration (1) and indicate whether it is feasible or infeasible to Problem P. Indicate on the graph the point this solution corresponds to and state whether it is a corner point of the feasible region of Problem P or not. Do not perform more than one iteration!