Before we proceed further, we now formally define some terms (which have been
used above) which we shall be using in the linear programming problems:
Objective function Linear function Z = ax + by, where a, b are constants, which has
to be maximised or minimized is called a linear objective function 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