Question: In a binary integer programming problem, there are three projects (X1, X2, and X3) the constraint if project 1 cannot be selected if both projects
In a binary integer programming problem, there are three projects (X1, X2, and X3) the constraint if project 1 cannot be selected if both projects 2 and 3 selected would be written _____.
Group of answer choices
X1 + X2 + X3 1
X1 X2 X3 1
X1 + X2 + X3 0
None of the choices is correct.
X1 + X2 + X3 2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
