A feasible solution to a linear programming problem

• A. must satisfy all problem constraints simultaneously
• B. need not satisfy all constraints
• C. must be a corner point of the feasible region
• D. must optimize the value of the objective function