A feasible solution to a linear programming problem

Group of answer choices

must satisfy all of the problem's constraints simultaneously.

need not satisfy all of the constraints, only the non$-$negativity constraints.

must give the maximum possible profit.

must be a corner point of the feasible region.