Question: irm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm's goal is to maximize
irm 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 30x1 + 30x2 + 25x3+ 35x4 s.t. 10x1 + 12x2 +5x3 +13x4 15 (Constraint 1) x1 x2 x3x4 2 2 (Constraint 2) x1 x21 (Constraint 3) x1+x3 21 (Constraint 4) x2x4 (Constraint 5) 1, if location j is selected Ij = 10, otherwise Solve this problem to optimality and answer the following questions: a. Which of the warehouse locations will/will not be selected? Location 1 will Location 2 will Location 3 will Location 4 will b. What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) Net present value c. How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.) Available capital irm 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 30x1 + 30x2 + 25x3+ 35x4 s.t. 10x1 + 12x2 +5x3 +13x4 15 (Constraint 1) x1 x2 x3x4 2 2 (Constraint 2) x1 x21 (Constraint 3) x1+x3 21 (Constraint 4) x2x4 (Constraint 5) 1, if location j is selected Ij = 10, otherwise Solve this problem to optimality and answer the following questions: a. Which of the warehouse locations will/will not be selected? Location 1 will Location 2 will Location 3 will Location 4 will b. What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) Net present value c. How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.) Available capital
Step by Step Solution
There are 3 Steps involved in it
To calculate the net present value NPV of the optimal solution we need to first determine the values of x y z and w which we found to be x 1 y 1 z 0 w 1 Now well substitute these values into the objec... View full answer
Get step-by-step solutions from verified subject matter experts
