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 In the above example, the set of inequalities (1) to (4)
are constraints