A firm has prepared the following binary integer program to evaluate a number of potential new capital projects. The firm's goal is to maximize the net present value of their decision while not spending more than their currently available capital.

Max $100$x$1+120$x$2+90$x$3+135$x$4$

s$.$t$.150$x$1+200$x$2+225$x$3+175$x$4<=500\{$Constraint $1\}$

x$1+$ x$2+$ x$3+$ x$4>=2\{$Constraint $2\}$

x$2+$ x$4<=1\{$Constraint $3\}$

x$2+$ x$3>=1\{$Constraint $4\}$

x$1=$ x$4\{$Constraint $5\}$

image

Which of the constraints ensures that at least two of the potential projects will be selected?

Group of answer choices

Constraint $3$

Constraint $4$

Constraint $2$

Constraint $1$

Constraint $5$