PLEASE MAKE SURE THAT YOU HAVE READ THE PROBLEM. There
are people who copy-pasted the given solutions from a different
problem.
Please Make Sure That You Have Read The Problem There Are People Who Copy Pasted The Given Solutions From A Different P 1 (27.46 KiB) Viewed 135 times
Please Make Sure That You Have Read The Problem There Are People Who Copy Pasted The Given Solutions From A Different P 2 (4.74 KiB) Viewed 135 times
Please Make Sure That You Have Read The Problem There Are People Who Copy Pasted The Given Solutions From A Different P 3 (6.3 KiB) Viewed 135 times
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 15x1 + 15x2 + 15x3+ 30x4 s.t.7xq + 13x2 + 11x3 + 10x4 5 20 Constraint 1} x1 + x2 + x3 + x4 2 2 (Constraint 2) x1 + x2 5 1 Constraint 3} *1 + x3 2 1 (Constraint 4) x2 = x4 (Constraint 5) ſ1, if location j is selected Dj 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
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!