Q$1.$ In a linear programming problem, the objective function and the constraints must be linear functions of the decision variables. a$.$ True b$.$ False Q$2.$ In a feasible problem, an equal$-$to constraint cannot be nonbinding. a$.$ True b$.$ False Q$3.$ Only binding constraints form the shape $($boundaries$)$ of the feasible region. a$.$ True b$.$ False Q$4.$ The constraint $5$ x$\_1-2$ x$\_2<=0$ passes through the point $(20,50).$ a$.$ True b$.$ False Q$5.$ Alternative optimal solutions oceur when there is no feasible solution to the problem. a$.$ True b$.$ False Q$6.$ Which of the following is a valid objective function for a linear programming problem? a$.$ Max $5$xy b$.$ Min $4$ x$+3$ y$+(2/3)$ z c$.$ Max $5$ x$^2+6$ y$^2$ d$.$ Min$($x$\_1+$x$\_2)/$ x$\_3$ Q$7.$ A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called a$.$ optimal. b$.$ feasible. c$.$ infeasible. d$.$ semi$-$feasible. Q$8.$ Slack a$.$ is the difference between the left and right sides of a constraint. b$.$ is the amount by which the left side of a constraint is smaller than the right side.