A simplex matrix for a standard maximization problem is given.

(a) Write the values of all the variables (use x1, x2, x3, . . . and s1, s2, s3, . . .) and of the objective function f.

(b) Indicate whether or not the solution from part (a) Is complete (optimal).

(c) If the solution is not complete, find the next pivot and state all row operations with that pivot (that is, row operations that make that pivot equal to 1, and then make other entries in the pivot column equal to 0). Do not perform the row operations.

1.

2.

2 0 1 - 0 75 14 3 45 3 -6 -6 3. 4 1 2 1 2 0 2 12 -lun 2.