Question:

Table below shows an initial basic feasible solution for a maximization linear programming problem. Perform one more iteration of the simplex method, and after that iteration, present the complete solution and check for the optimality.

$\backslash$table$[[,,x_1,x_2,x_3,s_1,s_2,s_3,],[$Basis$,c_B,5,8,12,0,0,0,],[s_1,0,3,4,5,1,0,0,80],[s_2,0,9,15,20,0,1,0,250],[s_3,0,1,-1,2,0,0,1,20],[,z_j,0,0,0,0,0,0,0],[,c_j-z_j,5,8,12,0,0,0,]]$