However, if it exists, it must occur at a corner point of R � Corner point method for solving a linear programming problem The method
comprises of the following steps:
(i) Find the feasible region of the linear programming problem and determine
its corner points (vertices) (ii) Evaluate the objective function Z = ax + by at each corner point