C$)$ The constraints are too restrictive

D$)$ The feasible region is a single point

$10.$ A solution to a linear programming problem that satisfies all construints but is not accescarily optimal is referred to as:

$11.$ A$)$ Feasible solution

$12.$ B$)$ Infeasible solution

$13.$ C$)$ Extreme solution

$14.$ D$)$ Optimal solution.

B$.$ True$/$False Questions $(2$ pts each$)$