Quantitative Methods Final
False
A car wash with two attendants who work together as a team would be an example of a multiple server system
Minimal Spanning Tree Method
A company needs to install wiring for a LAN network in a new building. Which analysis should be used?
Maximum Flow Method
A traffic system could be represented as a network in order to find possible bottlenecks. Which analysis should be used?
Min C = 3x + 3y + (1/3)z
A valid objective function in a linear programming problem
Linear Programming
A widely used technique designed to help managers and decision making relative to resource allocation
Minimal Spanning Tree
All the nodes must be connected in which analysis?
A (math for time)
Arrival rate
True
Balking is the act . of a customer refusing to enter a service system because the wait is too lengthy
States of Nature
Branches
12 customers per hour
If it takes 5 minutes to serve a customer at a fast food restaurant the service rate is
A balanced problem
In a transportation model, what is said to exist when total demand equals total supply
A feasible solution to a linear programming problem
Must satisfy all of the problems constraints simultaneously
Alternatives
Nodes
A computer program
Not a property of all linear programming problems.
Dominant decision
One that has a better payoff than another decision under each state of nature
False
Queue discipline describes customers' behavior in the queue
u
Service rate
MAD
Sum of errors divided by the number of terms
MAPD
Sum of the absolute errors divided by the total demands of those months
Cumulative error
Sum of the errors
Conditional Probability
The altered marginal probability of an event based on additional information
True
The arrival rate is the frequency at which customers arriver at a waiting line in a given time period according to a probability distribution.
Hurwicz criterion multiples
The best payoff by the coefficient of optimism
True
The calling population is the source of customers
False
The decision maker can control the states of nature
Maximin
The worst payoff for each alternative and choosing the alternative with the best worst
Critical path in a network model
activities have earliest start times that equal latest start times, path with the largest duration (longest time), & activities have no slack
The critical path of a network
is the longest time path through the network