Examlex
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 the most expensive?
Face Value
The nominal or dollar value printed on a financial instrument, such as a bond or stock certificate.
Premium
The amount paid for an insurance policy or the amount by which a bond or stock sells above its par value.
Straight-Line Amortization
A method of calculating equal amortization payments over an asset's useful life or a loan's term.
Interest Expense
The cost incurred by an entity for borrowed funds; this expense is reported on the income statement during the period in which the borrowing occurs.
Q16: Numbers should be included directly in formulas
Q19: A student is using a spreadsheet model
Q19: The figure below shows the possible routes
Q19: A new pizza restaurant is moving
Q33: A multiple-server queueing system with an exponential
Q35: Choosing the number of servers in a
Q60: A manufacturing firm has four plants
Q68: The operations manager for a local bus
Q75: The president of State University wants
Q77: Maximum flow problems are concerned with maximizing