1.Introduce slack variables and set up the initial simplex tableau. Do not solve.

Maximize: Subject to:

P = 3x + 3 y + 4 z
x + y + 3 z 15 4 x + 4 y + 3 z 65 x 0, y 0, z 0

2. Determine whatever the given simplex tableau is in final form. If so, found the solution to the associated regular linear programming problem. If not find the pivot element to be used in the iteration of the simplex method. X 2 -1 y 0 1 0 0 z 3 -1/2 u 1 0 0 6 v -1/4 0 3/2 w 0 0 1 0 p 0 0 0 1 Constant 19/21 21/2 30 63

3.Maximize subject. Solve by the simplex method

p = 5x + 3y x+ y 8 0 3x 9 0 x 0 y 0