Mat 540 Quiz 3

1011 Words5 Pages
Quiz 3 Question 1 | | | Surplus variables are only associated with minimization problems. Answer | | | | | | | Correct Answer: | False | | | | | Question 2 | | | A feasible solution violates at least one of the constraints. Answer | | | | | | | Correct Answer: | False | | | | | Question 3 | | | A linear programming model consists of only decision variables and constraints. Answer | | | | | | | Correct Answer: | False | | | | | Question 4 | | | Graphical solutions to linear programming problems have an infinite number of possible objective function lines. Answer | | | | | | | Correct Answer: | True | | | | | Question 5 | | | If the objective function is parallel to a constraint, the constraint is infeasible. Answer | | | | | | | Correct Answer: | False | | | | | Question 6 | | | A linear programming problem may have more than one set of solutions. Answer | | | | | | | Correct Answer: | True | | | | | Question 7 | | | In minimization LP problems the feasible region is always below the resource constraints. Answer | | | | | | | Correct Answer: | False | | | | | Question 8 | | | The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*. This linear programming problem is a:Answer | | | | | | | Correct Answer: | minimization problem | | | | | Question 9 | | | The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*. The equation for constraint DH is:Answer | | | | | | | Correct Answer: | X + 2Y ≥ 8 | | | | | Question 10 | | | The following is a

More about Mat 540 Quiz 3

Open Document