You are given the following linear programming model (see below) in algebraic form, where x1 and x2 are the decision variables and Z is the value of the overall measure of performance.The goal is to maximize the objective function Z = 3X1 + 2X2subject to:

Constraint on resource 1: 3x₁ + x₂ 9

Constraint on resource 2: x₁ + 2x₂ 8

And x1 and x2 are not negative, i.e., x1 > 0 and x2 > 0.

(a) Identify the objective function (Z = ??), the functional constraints, and the nonnegativity constraints in this model (see Hillier text pages 33-34 for a review).