Mat 540 Quiz 5
Attempt Score 34 out of 40 points
Question 1
2 out of 2 points If exactly 3 projects are to be selected from a set of 5 projects, this would be written as 3 separate constraints in an integer program. Answer
Selected Answer: False
Correct Answer: False . Question 2
2 out of 2 points Rounding non-integer solution values up to the nearest integer value will result in an infeasible solution to an integer linear programming problem. Answer
Selected Answer: False
Correct Answer: False . Question 3
2 out of 2 points If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a conditional constraint. Answer
Selected Answer: True
Correct Answer: True . Question 4 .2 out of 2 points If we are solving a 0-1 integer programming problem with three decision variables, the constraint x1 + x2 + x3 ≤ 3 is a mutually exclusive constraint. Answer
Selected Answer: False
Correct Answer: False . Question 5 .2 out of 2 points The solution to the LP relaxation of a maximization integer linear program provides an upper bound for the value of the objective function. Answer
Selected Answer: True
Correct Answer: True . Question 6 .2 out of 2 points A conditional constraint specifies the conditions under which variables are integers or real variables. Answer
Selected Answer: False
Correct Answer: False . Question 7 .2 out of 2 points In a __________ integer model, some solution values for decision variables are integers and others can be non-integer.
Answer
Selected Answer: mixed
Correct Answer: mixed . Question 8 .2 out of 2 points The solution to the linear programming relaxation of a minimization problem will always be __________ the value of the integer programming minimization problem.
Answer
Selected Answer: less than or equal to
Correct Answer: less than or equal
Question 1
2 out of 2 points If exactly 3 projects are to be selected from a set of 5 projects, this would be written as 3 separate constraints in an integer program. Answer
Selected Answer: False
Correct Answer: False . Question 2
2 out of 2 points Rounding non-integer solution values up to the nearest integer value will result in an infeasible solution to an integer linear programming problem. Answer
Selected Answer: False
Correct Answer: False . Question 3
2 out of 2 points If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a conditional constraint. Answer
Selected Answer: True
Correct Answer: True . Question 4 .2 out of 2 points If we are solving a 0-1 integer programming problem with three decision variables, the constraint x1 + x2 + x3 ≤ 3 is a mutually exclusive constraint. Answer
Selected Answer: False
Correct Answer: False . Question 5 .2 out of 2 points The solution to the LP relaxation of a maximization integer linear program provides an upper bound for the value of the objective function. Answer
Selected Answer: True
Correct Answer: True . Question 6 .2 out of 2 points A conditional constraint specifies the conditions under which variables are integers or real variables. Answer
Selected Answer: False
Correct Answer: False . Question 7 .2 out of 2 points In a __________ integer model, some solution values for decision variables are integers and others can be non-integer.
Answer
Selected Answer: mixed
Correct Answer: mixed . Question 8 .2 out of 2 points The solution to the linear programming relaxation of a minimization problem will always be __________ the value of the integer programming minimization problem.
Answer
Selected Answer: less than or equal to
Correct Answer: less than or equal