Simplex Method Consider the following linear programmingproblem:
maxz = 6x1 + 3x2 - 9x2 - 9x3 + 15x4
s.t. 2x1 + 4x2 +6x3 + 8x4 <= 80
6x1- 3x2 +3x3 + 6x4 <= 24
12x1 - 6x2 + 3x3 - 3x4 <= 30
x1,x2, x3, x4 >= 0
Rewrite the problem in standard form, that is, add the necessaryslack variables in order to consider only equality constraints (andnon-negativity).
What is the current value of the objective function?
Isthis the last iteration of the simplex method for thisproblem?
Perform the nextiteration of the simplex tableau method. That is, determine thepivot row, pivot column, and the pivot element,and do the necessaryrow operations (list them to the right of the tableau, beside therow you are changing).
