There are also some other
problems where we have to minimise a linear function subject to certain conditions
determined by a set of linear inequalities with variables as non-negative Such problems
are called Linear Programming Problems Thus, a Linear Programming Problem is one that is concerned with finding the
optimal value (maximum or minimum value) of  a linear function (called objective
function) of several variables (say x and y), subject to the conditions that the variables
are non-negative and satisfy a set of linear inequalities (called linear constraints) The term linear implies that all the mathematical relations used in the problem are
linear relations while the term programming refers to the method of determining a
particular programme or plan of action