Find the feasible region of the linear programming problem and determine its
corner points (vertices) either by inspection or by solving the two equations of
the lines intersecting at that point 2 Evaluate the objective function Z = ax + by at each corner point Let M and m,
respectively denote the largest and smallest values of these points