MAT540 - Quiz 5
Quantitative Methods: MAT540
Quiz 5
• Question 1
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 2 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 3 If we are solving a 0-1 integer programming problem with three decision variables, the constraint x1 + x2 ≤ 1 is a mutually exclusive constraint. Answer Selected Answer: True
Correct Answer: True • Question 4 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 5 In a 0-1 integer programming problem involving a capital budgeting application (where xj = 1, if project j is selected, xj = 0, otherwise) the constraint x1 - x2 ≤ 0 implies that if project 2 is selected, project 1 can not be selected. Answer Selected Answer: False
Correct Answer: False • Question 6 In a problem involving capital budgeting applications, the 0-1 variables designate the acceptance or rejection of the different projects. Answer Selected Answer: True
Correct Answer: True • Question 7 Binary variables are
Answer
Selected Answer:
0 or 1 only
Correct Answer:
0 or 1 only • Question 8 If the solution values of a linear program are rounded in order to obtain an integer solution, the solution is
Answer
Selected Answer: sometimes optimal and feasible
Correct Answer: sometimes optimal and feasible • Question 9 If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a __________ constraint.
Answer
Quiz 5
• Question 1
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 2 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 3 If we are solving a 0-1 integer programming problem with three decision variables, the constraint x1 + x2 ≤ 1 is a mutually exclusive constraint. Answer Selected Answer: True
Correct Answer: True • Question 4 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 5 In a 0-1 integer programming problem involving a capital budgeting application (where xj = 1, if project j is selected, xj = 0, otherwise) the constraint x1 - x2 ≤ 0 implies that if project 2 is selected, project 1 can not be selected. Answer Selected Answer: False
Correct Answer: False • Question 6 In a problem involving capital budgeting applications, the 0-1 variables designate the acceptance or rejection of the different projects. Answer Selected Answer: True
Correct Answer: True • Question 7 Binary variables are
Answer
Selected Answer:
0 or 1 only
Correct Answer:
0 or 1 only • Question 8 If the solution values of a linear program are rounded in order to obtain an integer solution, the solution is
Answer
Selected Answer: sometimes optimal and feasible
Correct Answer: sometimes optimal and feasible • Question 9 If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a __________ constraint.
Answer