LINEAR PROGRAMMING

Question 6 Consider the following simplex tableau that is NOT optimal: I1 rhs I2 13 $1 82 a1 0 1 0 -1 1 2 D 0 0 1 0 0 2 0 1 0 0 1 1 -2M - 1 (16M-1) 0 M 5M+1 0 -4M+2 3 where M is a parameter that represents a big number and 1, 2 and 3 are positive decision variables, s and so are slack or surplus variables, a and a2 are artificial variables, and - z is an objective function that must be maximised. Continue with the simplex algorithm until the final simplex tableau is found and deduce the optimal solution. If the LP problem is infeasible or unbounded, give the reason for this. If the LP problem has multiple optimal solutions, deduce the general optimal solu- tion. Important note: At each simpler tableau, indicate the entering variable, the leaving variable and the pivot element clearly. 2 0010 2x10 - 2333 a2 0 0 0 0 [16] BV a1 I3 S 02 23