Corner point method

The corner point method for bounded feasible region comprises of the following steps I. When the feasible region is bounded, M and m are the maximum and minimum values of Z. II. Find the feasible region of the linear programming problem and determine its corner points. Ill. Evaluate the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values of these points. The correct order of these above steps is

One of the corner points of the feasible region of inequalities gives

One of the corner points of the feasible region of inequalities gives

The corner points of the feasible region, shown as shaded in the graph below, are :

If a corner points of the feasible solutions are (0,10)(2,2)(4,0) (3,2) then the point of minimum Z=3x +2y is