The following is the optimal simplex tableau of a linear programming problem. The

objective is to maximize 3x1 + 2x2 , and x3, x4, and x5 are the slack variables.

(a)  Find the values of the unknowns a through i in the tableau.

(b)  Give the original (initial) LP.

(c)  Which constraints (you obtained in part (c)) are active (binding) in the optimal

solution? Which constraint(s) is(are) inactive?

(d)  Is there any alternative optimal solutions? If yes, represents the alternative

optimal solutions with a function.