Question 1

Constraints in a transshipment problem

Accepted Answer

A)  correspond to arcs.
B)  include a variable for every arc.
C)  require the sum of the shipments out of an origin node to equal supply.
D)  All of the alternatives are correct.E) All of the above
F) C) and D)

Question 2

The number of units shipped from origin i to destination j is represented by

Accepted Answer

A)  xij.
B)  xji.
C)  cij.
D)  cji.E) None of the above
F) A) and B)

Question 3

The objective of the transportation problem is to

Accepted Answer

A)  identify one origin that can satisfy total demand at the destinations and at the same time minimize total shipping cost.
B)  minimize the number of origins used to satisfy total demand at the destinations.
C)  minimize the number of shipments necessary to satisfy total demand at the destinations.
D)  minimize the cost of shipping products from several origins to several destinations.E) A) and D)
F) A) and C)

Question 4

Arcs in a transshipment problem

Accepted Answer

A)  must connect every node to a transshipment node.
B)  represent the cost of shipments.
C)  indicate the direction of the flow.
D)  All of the alternatives are correct.E) None of the above
F) C) and D)

Question 5

The assignment problem constraint x31 + x32 + x33 + x34 < 2 means

Accepted Answer

A)  agent 3 can be assigned to 2 tasks.
B)  agent 2 can be assigned to 3 tasks.
C)  a mixture of agents 1, 2, 3, and 4 will be assigned to tasks.
D)  there is no feasible solution.E) B) and C)
F) A) and D)

Question 6

If a transportation problem has four origins and five destinations, the LP formulation of the problem will have nine constraints.

Accepted Answer

A) True 
 B)False  True

Question 7

Consider a shortest route problem in which a bank courier must travel between branches and the main operations center.When represented with a network,

Accepted Answer

A)  the branches are the arcs and the operations center is the node.
B)  the branches are the nodes and the operations center is the source.
C)  the branches and the operations center are all nodes and the streets are the arcs.
D)  the branches are the network and the operations center is the node.E) B) and C)
F) A) and D) C

Question 8

A transportation problem with 3 sources and 4 destinations will have 7 decision variables.

Accepted Answer

A) True 
 B)False

Question 9

Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes before eventually leaving the city.When represented with a network,

Accepted Answer

A)  the nodes represent stoplights.
B)  the arcs represent one way streets.
C)  the nodes represent locations where speed limits change.
D)  None of the alternatives is correct.E) B) and C)
F) All of the above

Question 10

The problem which deals with the distribution of goods from several sources to several destinations is the

Accepted Answer

A)  maximal flow problem
B)  transportation problem
C)  assignment problem
D)  shortest-route problemE) All of the above
F) None of the above

Question 11

The shortest-route problem is a special case of the transshipment problem.

Accepted Answer

A) True 
 B)False

Question 12

In the LP formulation of a maximal flow problem, a conservation-of-flow constraint ensures that an arc's flow capacity is not exceeded.

Accepted Answer

A) True 
 B)False  False

Question 13

The assignment problem is a special case of the

Accepted Answer

A)  transportation problem.
B)  transshipment problem.
C)  maximal flow problem.
D)  shortest-route problem.E) All of the above
F) A) and B)

Question 14

Which of the following is not true regarding an LP model of the assignment problem?

Accepted Answer

A)  Costs appear in the objective function only.
B)  All constraints are of the > form.
C)  All constraint left-hand side coefficient values are 1.
D)  All decision variable values are either 0 or 1.E) A) and D)
F) None of the above

Question 15

Transshipment problem allows shipments both in and out of some nodes while transportation problems do not.

Accepted Answer

A) True 
 B)False

Question 16

A dummy origin in a transportation problem is used when supply exceeds demand.

Accepted Answer

A) True 
 B)False

Question 17

Which of the following is not true regarding the linear programming formulation of a transportation problem?

Accepted Answer

A)  Costs appear only in the objective function.
B)  The number of variables is (number of origins)  x (number of destinations) .
C)  The number of constraints is (number of origins)  x (number of destinations) .
D)  The constraints' left-hand side coefficients are either 0 or 1.E) A) and D)
F) B) and C)

Question 18

The parts of a network that represent the origins are

Accepted Answer

A)  the capacities
B)  the flows
C)  the nodes
D)  the arcsE) A) and C)
F) All of the above

Question 19

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function; the conversion does not affect the constraints.

Accepted Answer

A) True 
 B)False

Question 20

In the general linear programming model of the assignment problem,

Accepted Answer

A)  one agent can do parts of several tasks.
B)  one task can be done by several agents.
C)  each agent is assigned to its own best task.
D)  one agent is assigned to one and only one task.E) A) and B)
F) B) and D)

Exam 6: Distribution and Network Problems

Constraints in a transshipment problem

Correct AnswerverifiedShow Answer

The number of units shipped from origin i to destination j is represented by

Correct AnswerverifiedShow Answer

The objective of the transportation problem is to

Correct AnswerverifiedShow Answer

Arcs in a transshipment problem

Correct AnswerverifiedShow Answer

The assignment problem constraint x31 + x32 + x33 + x34 < 2 means

Correct AnswerverifiedShow Answer

If a transportation problem has four origins and five destinations, the LP formulation of the problem will have nine constraints.

Correct AnswerverifiedTrue

Consider a shortest route problem in which a bank courier must travel between branches and the main operations center.When represented with a network,

Correct AnswerverifiedC

A transportation problem with 3 sources and 4 destinations will have 7 decision variables.

Correct AnswerverifiedShow Answer

Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes before eventually leaving the city.When represented with a network,

Correct AnswerverifiedShow Answer

The problem which deals with the distribution of goods from several sources to several destinations is the

Correct AnswerverifiedShow Answer

The shortest-route problem is a special case of the transshipment problem.

Correct AnswerverifiedShow Answer

In the LP formulation of a maximal flow problem, a conservation-of-flow constraint ensures that an arc's flow capacity is not exceeded.

Correct AnswerverifiedFalse

The assignment problem is a special case of the

Correct AnswerverifiedShow Answer

Which of the following is not true regarding an LP model of the assignment problem?

Correct AnswerverifiedShow Answer

Transshipment problem allows shipments both in and out of some nodes while transportation problems do not.

Correct AnswerverifiedShow Answer

A dummy origin in a transportation problem is used when supply exceeds demand.

Correct AnswerverifiedShow Answer

Which of the following is not true regarding the linear programming formulation of a transportation problem?

Correct AnswerverifiedShow Answer

The parts of a network that represent the origins are

Correct AnswerverifiedShow Answer

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function; the conversion does not affect the constraints.

Correct AnswerverifiedShow Answer

In the general linear programming model of the assignment problem,

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

The assignment problem constraint x₃₁ + x₃₂ + x₃₃ + x₃₄ < 2 means

Correct Answer
verified

Correct Answer
verified
True

Correct Answer
verified
C

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
False

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified