Question 1 0 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: False Correct Answer: True

Question 2 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 3 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 4 2 out of 2 points

In a mixed integer model, some solution values for decision variables are integer and others are...