# MAT540 QUIZ 5 WEEK 9 (20/20) GUARANTEE - 87729

Solution Posted by

## anjis_devis

Rating : (21)B
Solution Detail
Price: \$15.00
• From: Mathematics, Calculus
• Posted on: Mon 02 Feb, 2015
• Request id: None
• Purchased: 0 time(s)
• Average Rating: No rating
Request Description
Solution Description

Question 1

Rounding non-integer solution values up to the nearest integer value will result in an infeasible solution to an integer linear programming problem.

True

False

2 points

Question 2

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

True

False

2 points

Question 3

If we are solving a 0-1 integer programming problem, the constraint x1 ? x2 is a conditional constraint.

True

False

2 points

Question 4

If we are solving a 0-1 integer programming problem with three decision variables, the constraint x1 + x2 ≤ 1 is a mutually exclusive constraint.

True

False

2 points

Question 5

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.

True

False

2 points

Question 6

A conditional constraint specifies the conditions under which variables are integers or real variables.

True

False

2 points

Question

Attachments