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 available capital. Max 20x1 + 30 x2 + 10x3 + 15x4 s.t.5x1 + 7x2 + 12x3 + 11x4 21 {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,iflocationjisselected0,otherwise

Solve this problem to optimality and answer the following questions:

A) Which of the warehouse locations will/will not be selected?

Location 1, Location 2, Location 3, Location 4?

B) What is the net present value of the optimal solution?

C) 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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!