Multiple Choice
Assume that we are using 0-1 integer programming model to solve a capital budgeting problem and xj = 1 if project j is selected and xj = 0, otherwise.
The constraint (x1 + x2 + x3 + x4 = 2) means that ________ out of the ________ projects must be selected.
A) exactly 1, 2
B) exactly 2, 4
C) at least 2, 4
D) at most 1, 2
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q31: <br> Max Z =   x1
Q32: If we graph the problem that requires
Q33: Saba conducts regular tours of his favorite
Q34: Consider a capital budgeting example with five
Q35: The _ method is based on the
Q37: In a _ integer model, some solution
Q38: The branch and bound method of solving
Q39: If we are solving a 0-1 integer
Q40: In a _ integer model, the solution
Q41: The college dean is deciding among three