Linear programming is mathematical technique for finding an op-timum (maximum or minimum) value f a function, called objective function of several independent variable, these variable being subject to various restrictions (or constraints) expressed as equations or ine-qualities. The term ‘linear’ indicates that the function to be maxi-mized or minimized is linear and that the corresponding constraints be represented by a system of linear inequalities or linear equations involving the variables.

A linear programming problem has the following essential parts:

(i)    A set of non-negative restriction. This is to avoid getting negative solutions in which we are not interested. For example, negative price or negative output do not mean anything.

(ii)    A set of linear constraints representing the limitations on the use of machinery, labour etc.

(iii)    An objective function to be maximized or minimized subject to the above constraints.

For more help in Linear Programming click the button below to submit your homework assignment