Consider the following 0-1 integer programming problem: If we wish to add the constraint that no more than two of these variables must be positive, how would this be written?
A) 2X + 2Y + 2Z ≤ 3
B) X + Y + Z ≤ 2
C) X ≤ 2, and Y ≤ 2, and Z ≤ 2
D) X, Y, Z ≤ 2
E) None of the above

Question

Consider the following 0-1 integer programming problem:  If we wish to add the constraint that no more than two of these variables must be positive, how would this be written?
A) 2X + 2Y + 2Z ≤ 3 
B) X + Y + Z ≤ 2 
C) X ≤ 2, and Y ≤ 2, and Z ≤ 2 
D) X, Y, Z ≤ 2 
E) None of the above

Quizplus · Accepted Answer

The constraint "no more than two of these variables must be positive" means that at most two variables can have a value of 1 (positive), and the rest must be 0 (negative). Therefore, the sum of the variables in the constraint must be less than or equal to 2. This can be written as X + Y + Z ≤ 2.

Consider the Following 0-1 Integer Programming Problem: If We