Question: Item 1 0 1 0 points Time Remaining 2 hours 1 7 minutes 5 0 seconds 0 2 : 1 7 : 5 0 eBookPrintReferencesCheck

Item10
10
points
Time Remaining 2 hours 17 minutes 50 seconds02:17:50
eBookPrintReferencesCheck my workCheck My Work button is now enabledItem 10
Time Remaining 2 hours 17 minutes 50 seconds02:17:50
WK Qu.10-01 A firm has prepared the following binary...
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 20x1+30x2+30x3+25x4
s.t.12x1+5x2+5x3+9x4<=22{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, otherwise
Solve this problem to optimality and answer the following questions:
Which of the warehouse locations will/will not be selected?

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 General Management Questions!