How do you determine whether the given simplex tableu is in final form? If so, find the solution to the associated regular linear programming problem. If not, find the pivot element to be used in the next iteration of the simplex method.

x y u v P /Constant
____________________
1 1 1 0 0 / 6
1 0 -1 1 0 / 2
____________________
3 0 5 0 1 / 30

Question

How do you determine whether the given simplex tableu is in final form? If so, find the solution to the associated regular linear programming problem. If not, find the pivot element to be used in the next iteration of the simplex method.

x  y   u  v  P  /Constant
____________________
1  1   1 0  0 / 6
1  0 -1 1  0 / 2
____________________
3  0  5  0  1 / 30

anonymous · Answer

I know that the simplex tableau is in final form because there are no negative numbers to the left of the vertical line in the last row. The thing I don't know is how to find the solution to the associated regular linear programming problem.