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

Options

A. III,I,II
B. II,III,I
C. II,I,III
D. I,III,II

Answer

B

Explanation

The corner point method for bounded feasible region comprises of the following steps and this correct order is as follows:
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. Let Mand m, respectively denote the largest and smallest values of these points. II. When the feasible region is bounded, Mand mare the maximum and minimum values of Z.