Thus, the
problem is having no feasible region and
hence no feasible solution Remarks From the examples which we
have discussed so far, we notice some
general features of linear programming
problems:
(i)
The feasible region is always a
convex region (ii)
The maximum (or minimum)
solution of the objective function occurs at the vertex (corner) of the feasible
region If two corner points produce the same maximum (or minimum) value
of the objective function, then every point on the line segment joining these
points will also give the same maximum (or minimum) value