A basic feasible solution in a linear programming problem with m constraints and n variables will have
1
at the most m variables with non zero values.
2
at least m variables with non zero values.
3
at the most n variables with non zero values.
4
at least n variables with non zero values.