Question: Note: This problem requires the use of a linear programming application such as Solver or Analytic Solver from Microsoft Excel. A firm has prepared the
Note: This problem requires the use of a linear programming application such as Solver or Analytic Solver from Microsoft Excel.
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 its decision while not spending more than its currently available capital.
Maximize 30x1 + 30x2 + 25x3 + 35x4
subject to 10x1 + 12x2 + 5x3 + 13x4 15 {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 selected; 0, if otherwise
Solve this problem to optimality and answer the following questions:
- Which of the warehouse locations will/will not be selected?
- What is the net present value of the optimal solution?
- How much of the available capital will be spent?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
