Mat 540 Quiz 5

1051 Words5 Pages
Quiz 5 Question 1 2 out of 2 points | | | 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 2 0 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: | True | Correct Answer: | False | | | | | Question 3 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 4 2 out of 2 points | | | 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 5 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 6 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 7 0 out of 2 points | | | If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2 is a __________ constraint.Answer | | | | |

More about Mat 540 Quiz 5

Open Document