Summary
� A linear programming problem is one that is concerned with finding the optimal
value (maximum or minimum) of a linear function of several variables (called
objective function) subject to the conditions that the variables are
non-negative and satisfy a set of linear inequalities (called linear constraints) Variables are sometimes called decision variables and are non-negative � A few important linear programming problems are:
(i) Diet problems
(ii) Manufacturing problems
(iii) Transportation problems
� The common region determined by all the constraints including the non-negative
constraints x ≥ 0, y ≥ 0 of a linear programming problem is called the feasible
region (or solution region) for the problem � Points within and on the boundary of the feasible region represent feasible
solutions of the constraints