Question:-
Simplex method of solving linear programming problem uses
Option (A)
all the points in the feasible region
Option (B)
only the corner points of the feasible region
Option(C)
intermediate points within the infeasible region
Option(D)
only the interior points in the feasible region.
Correct Option:
(B)
question-answer-faq-2359