Multiple Choice
A new pizza restaurant is moving into town. The owner is considering a number of potential sites and would like to minimize the initial investment involved with purchasing locations. However, the owner is very concerned about delivery time and wants to make sure that every neighborhood in the city can have a pizza delivered in 15 minutes or less. The owner has divided the city into 10 neighborhoods (A-J) and is currently considering a total of 8 different locations. To help with the decision, the owner formulated the following linear programming model:
Min 100x1 + 120x2 + 90x3 + 135x4 +75x5 + 85x6 + 110x7 + 135x8
s.t. x1 + x2 + x5 + x7 ? 1 {Neighborhood A constraint}
X1 + x2 + x3 ? 1 {Neighborhood B constraint}
X5 + x6 + x8 ? 1 {Neighborhood C constraint}
X1 + x4 + x7 ? 1 {Neighborhood D constraint}
X2 + x3 + x7 ? 1 {Neighborhood E constraint}
X3 + x4 + x8 ? 1 {Neighborhood F constraint}
X2 + x5 + x7 ? 1 {Neighborhood G constraint}
X1 + x4 + x6 ? 1 {Neighborhood H constraint}
X1 + x6 + x8 ? 1 {Neighborhood I constraint}
X1 + x2 + x7 ? 1 {Neighborhood J constraint}
Which of the locations is NOT within 15 minutes of neighborhood A?
A) Location 1
B) Location 2
C) Location 5
D) Location 6
E) Location 7
Correct Answer:

Verified
Correct Answer:
Verified
Q14: The university administration would like to
Q15: A problems where all the variables are
Q16: BIP can be used in capital budgeting
Q17: The university is scheduling cleaning crews
Q18: A bakery produces both pies and
Q20: A firm has prepared the following
Q21: Note: This problem requires the use
Q22: A BIP problem considers one yes-or-no decision
Q23: A bakery produces both pies and
Q24: A firm has prepared the following