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

Max $20$x$1+30$x$2+10$x$3+15$x$4$

s$.$t$.5$x$1+7$x$2+12$x$3+11$x$4<=21\{$Constraint $1\}$

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

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

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

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

image

Set up the problem in Excel and find the optimal solution. Which locations are selected?

Question $3$ options:

Location $1$

Location $2$

Location $4$

Locations $2$ and $4$

Locations $1$ and $3$