Solve the following linear programming problem using 2phase

Solve the following linear programming problem using 2-phase simplex method: Minimize z = 2x_1 + 3x_2 + 3x_3 + x_4 - 2x_5 subject to x_1 + 3x_2 + 4x_4 + x_5 = 2 x_1+ 2x_2 - 3x_4 + x_5 = 2 -x_1 -4x_2 + 3x_3 = 1 x_j greaterthanorequalto 0, j = 1, 5.

Solution

2phase simplex method its yields a feasible basic solution x1=1,x2=1/2,x3=1/3.two phase of the simplex algorithm is intiated with the tableau belonging to the basis {1,2,3}.after one more iteration one arrives of the tableau corresponding of basis B={1,2,4}