Test Bank Ch. 5
True/False: The shortest-route model assumes that one is trying to connect two end points in the shortest manner possible, rather than attempting to connect all the modes in the model.
TRUE
True/False: The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving.
TRUE
True/False: The typical transportation problem may ask the question, "How many of X should be shipped to point E from source A?"
TRUE
True/False: Transportation companies would definitely be interested in the shortest-route technique to optimize travel.
TRUE
True/False: Transportation models may be used when a firm is trying to decide where to locate a new facility
TRUE
True/False: We may begin the maximal-flow technique by picking an arbitrary path through the network.
TRUE
A line in a network that may represent a path or a route is called a(n) A) arc. B) branch. C) line. D) fork. E) sink.
A) arc.
Transportation models can be used for which of the following decisions? A) facility location B) production mix C) media selection D) portfolio selection E) employee shift scheduling
A) facility location
A technique that allows a researcher to determine the greatest amount of material that can move through a network is called A) maximal-flow. B) maximal-spanning. C) shortest-route. D) maximal-tree.
A) maximal-flow.
When using a general LP model for transportation problems, if there are 4 sources and 3 destinations, which of the following statements is true? A) There are typically 4 decision variables and 3 constraints. B) There are typically 12 decision variables and 7 constraints. C) There are typically 7 decision variables and 7 constraints. D) There are typically 12 decision variables and 12 constraints. E) There are typically 12 decision variables and 3 constraints.
B) There are typically 12 decision variables and 7 constraints.
The two most common objectives for the assignment problem are the minimization of A) uncertainty or inexperience. B) total costs or inexperience. C) total costs or total time. D) total time or inexperience. E) total costs or uncertainty.
C) total costs or total time.
A point in the network, that is at the beginning or end of a route is called a(n) A) arc. B) branch. C) line. D) node. E) source.
D) node.
Which of the following statements concerning the transshipment problem are false? A) The number of units shipped into a transshipment point should be equal to the number of units shipped out. B) There can be constraints on the number of units shipped out of an origin point. C) There can be constraints on the number of units shipped into a destination point. D) The transshipment problem can be solved with linear programming. E) Any units shipped from one origin point must all go to the same destination point.
E) Any units shipped from one origin point must all go to the same destination point.
True/False: In a transportation problem, each destination must be supplied by one and only one source.
FALSE
True/False: The transshipment problem is a maximization problem.
FALSE
True/False: Lins connecting nodes on a network are called links.
FALSE (arc)
True/False: A transportation problem with intermediate points is called a transshipment problem.
TRUE
True/False: A traveling salesperson might use the shortest-route technique to minimize the distance traveled to reach one of his/her customers.
TRUE
True/False: Assignment problems involve determining the most efficient assignment of people to projects, salesmen to territories, contracts to bidders, and so on.
TRUE
True/False: Busy highways are often analyzed with the maximal-flow technique.
TRUE
True/False: In a transportation problem, a single source may supply something to all destinations.
TRUE
True/False: In the maximal-flow technique a zero (0) means no flow or a one-way arc.
TRUE
True/False: The maximal-flow model assumes that there is a net flow from "source" to "sink".
TRUE
True/False: The maximal-flow model might be of use to an engineer looking for spare capacity in an oil pipeline system.
TRUE
True/False: The maximal-flow technique might be used by the U.S. Army Corps of Engineers to study water run-off in an attempt to minimize the danger from floods.
TRUE
True/False: The maximal-flow technique would be helpful to city planners in determining how freeways should be expanded.
TRUE
True/False: The objective of a transportation problem solution is to schedule shipments form sources to destinations while minimizing total transportation and production costs.
TRUE
True/False: The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.
TRUE
True/False: The points on the network are referred to as nodes.
TRUE
