Simplex method of solving linear programming problem uses
(a) all the points in the feasible region
(b) only the corner points of the feasible region
(c) intermediate points within the infeasible region
(d) only the interior points in the feasible region