Using Simplex Method For each of the following linear progra

Using Simplex Method

For each of the following linear programs, use the simplex algorithm and the tableau notation to find an optimal solution. In both cases, use the \"all slack\" variables as a starting basic variable and for the starting basic feasible solution. minimize z = - x_1 - x_2 - 3x_3 subject to x_1 + x_3

Solution

here z=-x1-x2-3x3 is the given equation

and also x1+x3<=1 here x1+x3 may be 0,1

same as x2+x3<=2 x2,x3 may be 0,1,2

and x1,x2,x3 are 0 to infinite

so, we can take the equation -x1-x2-3x3=z

taking the values x1 and x2 and x3 are 0,1,2

then sub in equation we have -0-1-3=-4

here we have to consider x1+x2+x3=0