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