Afeasible solution to a linear programming problem: a) must be a corner point of the feasible region. b) must satisfy all of the problem's constraints simultaneously. c) need not satisfy all of the constraints, only the non-negativity constraints. d) must give the maximum possible profit. e) must give the minimum possible cost.