Question $19$:

Linear programming allows a manager to find the best mix of activities to pursue

and at what levels.

$($a$)$ True

$($b$)$ False

Question $20$: Linear programming problems always involve either maximizing or minimizing an objective function.

$($a$)$ True

$($b$)$ False

Question $21$: An infeasible solution violates all of the constraints of the problem.

$($a$)$ True

$($b$)$ False

Question $22$: A circle would be an example of a feasible region for a linear programming problem.

$($a$)$ True

$($b$)$ False