Consider the following simplex tableau which is not optimal: Simplex Tableau 2 0 0 0 1...

Transcribed Image Text:

Consider the following simplex tableau which is not optimal: Simplex Tableau 2 0 0 0 1 X1 1 0 1 -2M - 1 I2 ²33 16M - 1 I3 $1 -1 0 1 0 0 0 0 M $2 -333 33 (5M+1) where M is a parameter that represents a big number and 1, 2 and 3 are positive decision variables, - s₁ and s₂ are slack or surplus variables, a₁ and a2 are artificial variables, z is an objective function that must be maximised. a1 1 0 0 0 a2 0 0 1 0 rhs 1 2 2 -4M+2 BV a1 I3 a2 2 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 solution. Consider the following simplex tableau which is not optimal: Simplex Tableau 2 0 0 0 1 X1 1 0 1 -2M - 1 I2 ²33 16M - 1 I3 $1 -1 0 1 0 0 0 0 M $2 -333 33 (5M+1) where M is a parameter that represents a big number and 1, 2 and 3 are positive decision variables, - s₁ and s₂ are slack or surplus variables, a₁ and a2 are artificial variables, z is an objective function that must be maximised. a1 1 0 0 0 a2 0 0 1 0 rhs 1 2 2 -4M+2 BV a1 I3 a2 2 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 solution.

Answer rating: 100% (QA)

NO 0 NO 1 22 1 O M1 211 212 2 2 12 2 772 12 1 320 213 0 1 O 2 S T 23 0 ... View the full answer