In the above example, Z = 250x + 75y is a linear objective function Variables x and
y are called decision variables Constraints The linear inequalities or equations or restrictions on the variables of a
linear programming problem are called constraints The conditions x ≥ 0, y ≥ 0 are
called non-negative restrictions