Mathematics · Linear Programming

Consider a Linear Programming Problem where the objective function is to Minimize Z = 2x1 + 3x2. The extreme corner points of the feasible region, defined by the constraints x1 + x2 ≥ 4, 2x1 + x2 ≥ 6, and x1, x2 ≥ 0, are evaluated to be (0, 6), (2, 2), and (4, 0). Calculate the exact value of the objective function Z at the optimal solution.