$1.$ An LP model for a large$-$scale production scheduling problem involving numerous products, machines, and time periods can require thousands of decision variables and constraints

a$.$ True

b$.$ False

$2.$ The constraint x$1-$x$20$ implies that if project $1$ is selected, project $2$ cannot be

a$.$ True

b$.$ False

$3.$ Ifxl$+$x$2500$y$1$ and y$1$ is $0-1,$ then if yl is $0,$ x$1$ and x$2$ will be $0$

a$.$ The

b$.$ Fabe

$4.$ Linear programming only permits integer solutions.

a$.$ True

$5.$ When formulating a linear programming problem on a spreadsheet, objective cells will show the levels of activities for the decisions being made.

a$.$ True

h$.$ False

$6.$ When solving linear programming problems graphically, there are an infinite number of possible objective function lines.

a$.$ True

b$.$ False

$7.$ Whenever total supply is less than total demand in a transportation problem, the LP model does not determine how the unsatisfied demand is handied..

a$.$ True

b$.$ False

$8.$ An optimal solution to a linear programming problem can be found at an extreme point of the feasible region for the problem.

a$.$ True

b$.$ False

S $9.$ The point $(3,2)$ is feasible for the constraint $2$x$,+6$x$,3030.$

a$.$ Truc

b$.$ False