Consider the Following 0-1 Integer Programming Problem: Minimize 20X

Multiple Choice

Consider the following 0-1 integer programming problem: Minimize 20X + 36Y +24Z
Subject to: 2X + 4Y + 3Z ≥ 7
12X + 8Y + 10Z ≥ 25
X, Y, Z must be 0 or 1
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