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 = x1 + 2x2
Subject to
Constraint on resource 1: x1 + x2  5 (amount available)
Constraint on resource 2: x1 + 3x2  9 (amount available)
And
x1  0 x2  0
a. Identify the objective function, the functional constraints, and the non-negativity constraints in this model.
b. Incorporate this model into a spreadsheet.
c. Is (x1, x2) = (3, 1) a feasible solution?
d. Is (x1, x2) = (1, 3) a feasible solution?
e. Use Solver to solve this model.