MGMT Science - Week 3

(T/F) A transportation problem with 3 sources and 4 destinations will have 7 variables

False

(T/F) In a maximum flow problem, flow is permitted in both directions and is represented by a pair of arcs pointing in opposite directions

False

(T/F) When demand and supply are not equal in a transportation problem then the problem cannot be solved.

False

(T/F) A shortest path problem is required to have only a single destination.

True

(T/F) Maximum flow problems are concerned with maximizing the flow of goods through a distribution network

True

(T/F) The assignment problem is a special case of the transportation problem in which all supply and demand values equal one.

True

(T/F) The direction of flow in the shortest-route problem is always out of the origin node and into the destination node.

True

(T/F) Transportation problems are a special type of distribution-network problem.

True

(T/F) Transportation problems are concerned with distributing commodities from sources to destinations in such a way as to minimize the total distribution cost.

True

(T/F) if a transportation problem has four origins and five destinations, the LP formulation of the problem will have nine constraints.

True

Decision variables in network flow problems are represented by a) arcs b) nodes c) demands d) supplies

a) arcs

Maximum flow problems are converted to transshipment problems by a) connecting the supply and demand nodes with a return arc b) adding extra supply nodes c) requiring integer solutions d) adding supply limits on the supply nodes

a) connecting the supply and demand nodes with a return arc

The assignment problem is a special case of the a) transportation problem b) transshipment problem c) maximum flow problem d) shortest-route problem

a) transportation problem

If a transportation problem has four origins and five destinations, the LP formula of the problem will have a) 20 constraints b) 9 constraints c) 18 constraints d) 5 constraints

b) 9 constraints

The objective of the transportation problem is to a) minimize the number of origins used to satisfy total demand at the destinations b) minimize the cost of shipping products from several origins to several destinations c) minimize the number of shipments necessary to satisfy total demand at the destinations d) identify one origin that can satisfy total demand at the destinations and at the same time minimize total shipping cost

b) minimize the cost of shipping products from several origins to several destinations

The problem which deals with the distribution of goods from several sources to several destinations is the a) shortest-route problem b) transportation problem c) assignment problem d) maximum flow problem

b) transportation problem

A node which can both send to and receive from other nodes is a a) supply node b) transshipment node c) random node d) demand node

b) transshipment node

A maximum flow problem differs from other network models in which way? a) multiple supply nodes are used b) arcs have unlimited capacity c) arcs have limited capacity d) arcs are two directional

c) arcs have limited capacity

Arcs in a transshipment problem 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

c) indicates the direction of the flow

The parts of a network that represent the origins are a) the capacities b) the flows c) the nodes d) the arcs

c) the nodes