Consider the following problem.
Minimize Z = 3x1 + 2x2,
2x1 + x2 ≥ 10
-3x1 + 2x2 ≤ 6
x1 + x2 ≥ 6
x1 ≥ 0, x2 ≥ 0.
(a) Using the Big M method, construct the complete first simplex tableau for the simplex method and identify the corresponding initial (artificial) BF solution. Also identify the initial entering basic variable and the leaving basic variable.
(b) Work through the simplex method step by step to solve the problem.