In a 0-1 integer programming problem involving a capital budgeting application (where xj = 1, if project j is selected, xj = 0, otherwise) the constraint x1 - x2 ≤ 0 implies that if project 2 is selected, project 1 cannot be selected.

Question

Quizplus · Accepted Answer

The constraint x1 - x2 ≤ 0 implies that if project 1 is selected (x1 = 1), then project 2 must also be selected (x2 = 1) for the inequality to hold true. It does not prevent project 1 from being selected if project 2 is selected; rather, it prevents project 1 from being selected without also selecting project 2.

In a 0-1 Integer Programming Problem Involving a Capital Budgeting