Exercises 9–16 relate to a primal linear programming problem of finding x in Rⁿ so as to maximize f (x) = c^Tx subject to Ax ≤ b and x ≥ 0. Mark each statement True or False (T/F). Justify each answer.

If the primal problem has an optimal solution, then the final tableau in the simplex method also gives the optimal solution to the dual problem.