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 x̅ is an optimal solution to the primal problem and ŷ is a feasible solution to the dual problem such that g(ŷ) = f(x̅), then g(ŷ) is an optimal solution to the dual problem.