3 the following is the current simplex tableau of a linear programming problem the objective is to minimize 2x4 x5 2x6 and x1xz and xz are the slack variables x2 x4 x5 h x6 g rhs 12 6 8 x6 2 14678

df6cea6b-a826-4645-be60-ea4ec6fd27f6

SOLVED:Determine whether the given simplex tableau 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 z s t u v P Constant 1 0 0 (2)/(5) 0 -(6)/(5) -(8)/(5) 0 4 0 0 0 -(2)/(5) 1 (6)/(5) (8)/(5) 0 5 0 1 0 0 0 1 0 0 12 0