Consider the following LPP: Maximize Z = 2x1 + 5x2 + 3x3

Subject to: 2x1 + 3x2 + 4x3 + x4 = 300

8x1 + x2 + x3 + 5x4 = 300

x1, x2, x3, x4 0

a) Set this problem up for solution using the Big M method. Give the initial tableau for the simplex method.

b. Perform the first pivot. Explain whether you have an optimal solution and how you can tell. State the next pivot if it is needed, and give the solution corresponding to the tableau.