Essay
A company wants to build a new factory in either Atlanta or Columbia.It is also considering building a warehouse in whichever city is selected for the new factory.The following table shows the net present value NPV)and cost of each facility.The company wants to maximize the net present value of its facilities,but it only has $16 million to invest.
Variable Decision
NPV
$million)
Cost $million)
X1 Factory in Columbia 3 10
X2 Factory in Atlanta 4 8
X3 Warehouse in Columbia 2 6
X4 Warehouse in Atlanta 1 5
Based on this ILP formulation of the problem what is the optimal solution to the problem?
MAX: 3 X1 + 4 X2 + 2 X3 + X4
Subject to: 10 X1 + 8 X2 + 6 X3 + 5 X4 ≤ 15
X1 + X2 = 1 X3 + X4 ≤ 1 X3 − X1 ≤ 0 X4 − X2 ≤ 0 Xi = 0,1
Correct Answer:

Verified
X1 X2 X3 X4
Objective
Function Cost F...View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Correct Answer:
Verified
Objective
Function Cost F...
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q18: The branch-and-bound algorithm starts by<br>A) relaxing all
Q20: Rounding the LP relaxation solution up or
Q24: A city wants to locate 2
Q28: How is an LP problem changed into
Q31: A certain military deployment requires supplies
Q32: The branch & bound algorithm stops when:<br>A)
Q59: Exhibit 6.1<br>The following questions pertain to the
Q68: Variables, which are not required to assume
Q77: Any integer variable in an ILP that
Q78: Suppose you want to maximize an objective