Question: A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firms goal is to maximize
A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firms goal is to maximize the net present value of their decision while not spending more than their currently available capital.
Max 25x1 + 15x2 + 25x3+ 15x4 s.t. 5x1 + 11x2 + 4x3 + 5x4 11 {Constraint 1} x1 + x2 + x3 + x4 2 {Constraint 2} x1 + x2 1 {Constraint 3} x1 + x3 1 {Constraint 4} x2 = x4 {Constraint 5}
xj = {1, if location j is selected0, otherwisexj = 1, if location j is selected0, otherwise
Solve this problem to optimality and answer the following questions:
a.What is the net present value of the optimal solution? (Round your answer to the nearest whole number.)
b.How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
