2.8. You are given the following linear programming model in algebraic form, where x1 and x2 are the decision variables and Z is the value of the overall measure of performance.

Maximize Z = 3x₁ + 2x₂

_{subject to}

Constraint on resource 1: 3x1 + x₂ < 9 (amount available)

Constraint on resource 2: x₁ + 2x₂ < 8 (amount available) and

x₁ > 0 x₂> 0

a. Identify the objective function, the functional con- straints, and the nonnegativity constraints in this model.

b. incorporate this model into a spreadsheet

c. Is (x1, x2) = (2, 1) a feasible solution?

d. Is (x1, x2) = (2, 3) a feasible solution?

e. Is (x1, x2) = (0, 5) a feasible solution?

f. Use Solver to solve this model.