Question: 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
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 avaliable capital. Max20x1+36x2+10x3+15y41.5.5x1+7x2+12x3+11x421(Constraint1)x3+x2+x3+x422[Constraint2]x1+x21[Contraint3]x1x31(Constraint4)x2=x4[Constraint5]xj={1,iflocationjisselected0,otherwise Solve this problem to optimality and answer the following questions: a. Which of the warehouse locations will will not be selected? b. What is the net present value of the optimal solution? Note: Round your answer to the nearest whole number. c. How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limity? Note: Round your answer to the nearest whole number
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
