The points on the network are referred to as nodes.
admin
1) The points on the network are referred
to as nodes.
2) Lines connecting nodes on a network are
called links.
3) Transportation models may be used when
a firm is trying to decide where to locate a new facility.
4) A typical transportation problem may ask
the question, “How many of X should be shipped to point E from source
A?”
5) The objective of a transportation
problem solution is to schedule shipments from sources to destinations while
minimizing total transportation and production costs.
6) In a transportation problem, each
destination must be supplied by one and only one source.
7) In a transportation problem, a single
source may supply something to all destinations.
8) Assignment problems involve determining
the most efficient assignment of people to projects, salesmen to territories,
contracts to bidders, and so on.
9) The objective of an assignment problem
solution most often is to minimize the total costs or time of performing the
assigned tasks.
10) In the assignment problem, the costs
for a dummy row will be equal to the lowest cost of the column for each
respective cell in that row.
11) A transportation problem with
intermediate points is called a transshipment problem.
12) The transshipment problem is a
maximization problem.
13) The minimal-spanning tree technique
finds the shortest route to a series of destinations.
14) In the minimal-spanning tree
technique, it is necessary to start at the last node in the network.
15) The maximal-flow technique would be
helpful to city planners in determining how freeways should be expanded.
16) The minimal-spanning tree technique
determines the path through the network that connects all the points while
minimizing total distance.
17) The shortest-route technique is the
same as the minimal-spanning tree technique.
18) Busy highways are often analyzed with
the maximal-flow technique.
19) Transportation companies would
definitely be interested in the shortest-route technique to optimize travel.
20) Cable television companies would
employ the shortest-route technique to lay out the cables connecting individual
houses.
21) We may begin the maximal-flow
technique by picking an arbitrary path through the network.
22) 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.
23) The shortest-route technique might be
used by someone planning a vacation in order to minimize the required amount of
driving.
24) A traveling salesperson might use the
shortest route technique to minimize the distance traveled to reach one of
his/her customers.
25) In the minimal-spanning tree
technique, if there is a tie for the nearest node, that suggests that there may
be more than one optimal solution.
26) The maximal-flow model might be of use
to an engineer looking for spare capacity in an oil pipeline system.
27) 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 nodes in the model.
28) In the maximal-flow technique, a zero
(0) means no flow or a one-way arc.
29) The maximal-flow model assumes that
there is a net flow from “source” to “sink.”
30) If your goal was to construct a
network in which all points were connected and the distance between them was as
short as possible, the technique that you would use is
A) shortest-route.
B) maximal-flow.
C) shortest-spanning tree.
D) minimal-flow.
E) minimal-spanning tree.
1) The points on the network are referred
to as nodes.2) Lines connecting nodes on a network are
called links.3) Transportation models may be used when
a firm is trying to decide where to locate a new facility.4) A typical transportation problem may ask
the question, “How many of X should be shipped to point E from source
A?”5) The objective of a transportation
problem solution is to schedule shipments from sources to destinations while
minimizing total transportation and production costs.6) In a transportation problem, each
destination must be supplied by one and only one source.7) In a transportation problem, a single
source may supply something to all destinations.8) Assignment problems involve determining
the most efficient assignment of people to projects, salesmen to territories,
contracts to bidders, and so on.9) The objective of an assignment problem
solution most often is to minimize the total costs or time of performing the
assigned tasks.10) In the assignment problem, the costs
for a dummy row will be equal to the lowest cost of the column for each
respective cell in that row.11) A transportation problem with
intermediate points is called a transshipment problem.12) The transshipment problem is a
maximization problem.13) The minimal-spanning tree technique
finds the shortest route to a series of destinations.14) In the minimal-spanning tree
technique, it is necessary to start at the last node in the network.15) The maximal-flow technique would be
helpful to city planners in determining how freeways should be expanded.16) The minimal-spanning tree technique
determines the path through the network that connects all the points while
minimizing total distance.17) The shortest-route technique is the
same as the minimal-spanning tree technique.18) Busy highways are often analyzed with
the maximal-flow technique.19) Transportation companies would
definitely be interested in the shortest-route technique to optimize travel.20) Cable television companies would
employ the shortest-route technique to lay out the cables connecting individual
houses.21) We may begin the maximal-flow
technique by picking an arbitrary path through the network.22) 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.23) The shortest-route technique might be
used by someone planning a vacation in order to minimize the required amount of
driving.24) A traveling salesperson might use the
shortest route technique to minimize the distance traveled to reach one of
his/her customers.25) In the minimal-spanning tree
technique, if there is a tie for the nearest node, that suggests that there may
be more than one optimal solution.26) The maximal-flow model might be of use
to an engineer looking for spare capacity in an oil pipeline system.27) 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 nodes in the model.28) In the maximal-flow technique, a zero
(0) means no flow or a one-way arc.29) The maximal-flow model assumes that
there is a net flow from “source” to “sink.”30) If your goal was to construct a
network in which all points were connected and the distance between them was as
short as possible, the technique that you would use isA) shortest-route.B) maximal-flow.C) shortest-spanning tree.D) minimal-flow.E) minimal-spanning tree.
