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 +75x 5 + 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 within 15 minutes of neighborhoods C, H, and I?
A) Location 2
B) Location 4
C) Location 6
D) Location 8
E) None of these locations is within 15 minutes of neighborhoods C, H, and I.
Correct Answer:

Verified
Correct Answer:
Verified
Q65: Note: This problem requires the use
Q66: If a firm wishes to choose at
Q67: A manufacturer produces both widgets and gadgets.
Q68: A parameter analysis report can be used
Q69: When binary variables are used in a
Q71: A manufacturer has the capability to
Q72: Binary integer programming problems can answer which
Q73: A firm has prepared the following
Q74: The university is scheduling cleaning crews
Q75: If a firm wishes to choose at