McG_network optimization_pop quiz_version1

The model for any minimum-cost flow problem is represented by a network with flow passing through it.

• true

• false

Tags

CCSS.HSA.CED.A.2

CCSS.HSA.CED.A.3

In a feasible minimum-cost flow problem, the network has enough arcs with sufficient capacity to enable all the flow generated at the supply nodes to reach all the demand nodes.

• true

• false

Tags

CCSS.HSA.CED.A.3

The objective of a minimum-cost flow problem is to minimize the total cost of sending the available supply through the network even if all demand is not satisfied.

• true

• false

Tags

CCSS.HSA.CED.A.2

CCSS.HSA.CED.A.3

CCSS.HSA.REI.C.6

Any minimum-cost flow problem where each arc can carry any desired amount of flow is a transshipment problem.

• true

• false

Tags

CCSS.HSA.CED.A.3

CCSS.HSA.REI.C.6

The source and sink of a maximum flow problem are analogous to the supply nodes and demand nodes of a minimum cost flow problem.

• true

• false

Tags

CCSS.HSA.CED.A.3

Shortest path problems are concerned with finding the shortest route through a network.

• true

• false

Tags

CCSS.HSA.REI.C.6

In a shortest path problem there are no arcs permitted, only links.

• true

• false

Which of the following is an example of a transshipment node?

• Storage facilities

• Processing facilities

• Short-term investment options

• Warehouses

• All of the choices are correct.

For a minimum-cost flow problem to have a feasible solution, which of the following must be true?

• There is the same number of supply nodes and demand nodes.

• There is only one supply node and one demand node.

• There is an equal amount of supply and demand.

• The supply and demand must be integers.

• The transshipment nodes must be able to absorb flow.

Tags

CCSS.HSA.CED.A.2

CCSS.HSA.CED.A.3

Which of the following is not an assumption of a shortest path problem?

• The lines connecting certain pairs of nodes always allow travel in either direction.

• Associated with each link or arc is a nonnegative number called its length.

• A path through the network must be chosen going from the origin to the destination.

• The objective is to find a shortest path from the origin to the destination.

• None of the choices is correct.