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$)$

True or False: For a convex programming problem, the relative minimum could not be a global minimum.

True or False: If $S$ is not in the feasible regions, the dot product between $S$ and the gradient of the constraint curve could also be negative.

True or False: In a feasible region, all points satisfy the problem's constraints, but not all are necessarily optimal.

True or False: If a linear programming problem has more than one solution, it must have an infinite number of solutions.

True or False: The objective function in a linear programming problem can have multiple local minima

True or False: The Karush$-$Kuhn$-$Tucker $($KKT$)$ conditions are sufficient conditions for optimaliyy in non$-$linear programming problems with differentiable objective functions and constraints.

True or False: Slack variables are added to inequality constraints to convert them into equality constraints in the standard form of a linear programming problem.

True or False: Every linear programming problem can be solved using the graphical method, regardless of the number of variables.

True or False: In the simplex method, if a variable enters the basis, then it must satisfy the condition $\frac{b_c^{**}}{a_s}=ma{x}_{i0}(\frac{b_i^{**}}{a_s^{**}}).$

True or False: Nonlinear programming prob programming problems for eation.