Mat 540 Quiz 1

 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
2 out of 2 points


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:
Tru
e




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




This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 12:07:08 GMT -06:00


https://www.coursehero.com/file/10494813/Quiz-5-MAT-540/

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

Answer
Selected
Answer: False
Correct Answer:
False




 Question 5
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:
Tru
e




 Question 6
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 7
2 out of 2 points


If we are solving a 0­1 integer programming problem, the constraint x1 = x2 is a
__________ constraint.
Answer




This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 12:07:08 GMT -06:00


https://www.coursehero.com/file/10494813/Quiz-5-MAT-540/