Question

In a linear programming problem, if a basic solution has no more than m positive

xj (j = 1, 2 , n), it is called         

(a) Basic feasible solution

(b) Unbounded solution

(c) Non-degenerate basic feasible solution

(d) None of the above