Question 1

A transshipment constraint must contain a variable for every arc entering or leaving the node.

Accepted Answer

A) True 
 B)False

Question 2

The maximal flow problem can be formulated as a capacitated transshipment problem.

Accepted Answer

A) True 
 B)False

Question 3

Whenever total supply is less than total demand in a transportation problem, the LP model does not determine how the unsatisfied demand is handled.

Accepted Answer

A) True 
 B)False

Question 4

In a transshipment problem, shipments

Accepted Answer

A)  cannot occur between two origin nodes.
B)  cannot occur between an origin node and a destination node.
C)  cannot occur between a transshipment node and a destination node.
D)  can occur between any two nodes.

Question 5

The capacitated transportation problem includes constraints which reflect limited capacity on a route.

Accepted Answer

A) True 
 B)False

Question 6

We assume in the maximal flow problem that

Accepted Answer

A)  the flow out of a node is equal to the flow into the node.
B)  the source and sink nodes are at opposite ends of the network.
C)  the number of arcs entering a node is equal to the number of arcs exiting the node.
D)  None of the alternatives is correct.

Question 7

When the number of agents exceeds the number of tasks in an assignment problem, one or more dummy tasks must be introduced in the LP formulation or else the LP will not have a feasible solution.

Accepted Answer

A) True 
 B)False

Question 8

The shortest-route problem finds the shortest-route

Accepted Answer

A)  from the source to the sink.
B)  from the source to any other node.
C)  from any node to any other node.
D)  from any node to the sink.

Question 9

The direction of flow in the shortest-route problem is always out of the origin node and into the destination node.

Accepted Answer

A) True 
 B)False

Question 10

The difference between the transportation and assignment problems is that

Accepted Answer

A)  total supply must equal total demand in the transportation problem
B)  the number of origins must equal the number of destinations in the transportation problem
C)  each supply and demand value is 1 in the assignment problem
D)  there are many differences between the transportation and assignment problems

Question 11

When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP formulation.

Accepted Answer

A) True 
 B)False

Exam 6: Distribution and Network Problems

The direction of flow in the shortest-route problem is always out of the origin node and into the destination node.

Correct Answer
verified

The shortest-route problem finds the shortest-route

Correct Answer
verified

Whenever total supply is less than total demand in a transportation problem, the LP model does not determine how the unsatisfied demand is handled.

Correct Answer
verified

When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP formulation.

Correct Answer
verified

The capacitated transportation problem includes constraints which reflect limited capacity on a route.

Correct Answer
verified

A transshipment constraint must contain a variable for every arc entering or leaving the node.

Correct Answer
verified

When the number of agents exceeds the number of tasks in an assignment problem, one or more dummy tasks must be introduced in the LP formulation or else the LP will not have a feasible solution.

Correct Answer
verified

In a transshipment problem, shipments

Correct Answer
verified

The maximal flow problem can be formulated as a capacitated transshipment problem.

Correct Answer
verified

The difference between the transportation and assignment problems is that

Correct Answer
verified

We assume in the maximal flow problem that

Correct Answer
verified

Exam 6: Distribution and Network Problems

The direction of flow in the shortest-route problem is always out of the origin node and into the destination node.

Correct AnswerverifiedShow Answer

The shortest-route problem finds the shortest-route

Correct AnswerverifiedShow Answer

Whenever total supply is less than total demand in a transportation problem, the LP model does not determine how the unsatisfied demand is handled.

Correct AnswerverifiedShow Answer

When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP formulation.

Correct AnswerverifiedShow Answer

The capacitated transportation problem includes constraints which reflect limited capacity on a route.

Correct AnswerverifiedShow Answer

A transshipment constraint must contain a variable for every arc entering or leaving the node.

Correct AnswerverifiedShow Answer

When the number of agents exceeds the number of tasks in an assignment problem, one or more dummy tasks must be introduced in the LP formulation or else the LP will not have a feasible solution.

Correct AnswerverifiedShow Answer

In a transshipment problem, shipments

Correct AnswerverifiedShow Answer

The maximal flow problem can be formulated as a capacitated transshipment problem.

Correct AnswerverifiedShow Answer

The difference between the transportation and assignment problems is that

Correct AnswerverifiedShow Answer

We assume in the maximal flow problem that

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified