Question: business analyticsmanagement science given the linear programming problem maximize z...
[Business Analytics/Management Science]
Given the linear programming problem:
Maximize Z = x1 + 2x2
x1 + x2 ≤ 6
x1 - x2 ≥ 0
x1 + x2 ≥ 3
x1, x2 ≥ 0
a. Graph the constraints and identify the feasible region.
b. Determine the optimal solution (Show your work).
c. Are any constraints binding? If so, which one?