Spreadsheet Modeling And Decision Analysis 7th Edition By Cliff Ragsdale – Test Bank
- Almost all network problems can be viewed as special cases of the
- transshipment problem.
- shortest path problem.
- maximal flow problem.
- minimal spanning tree problem.
ANSWER: a
- The arcs in a network indicate all of the following?
- routes
- paths
- constraints
- connections
ANSWER: c
- A factory that ships items through the network would be represented by which type of node?
- demand
- supply
- random
- decision
ANSWER: b
- A node that can both send to and receive from other nodes is a
- demand node.
- supply node.
- random node.
- transshipment node.
ANSWER: d
- Demand quantities for demand nodes in a transshipment problem are customarily indicated by
- positive numbers.
- negative numbers.
- imaginary numbers.
- either positive or negative numbers.
ANSWER: a
- Decision variables in network flow problems are represented by
- nodes.
- arcs.
- demands.
- supplies.
ANSWER: b
7.The number of constraints in network flow problems is determined by the number of
- nodes.
- arcs.
- demands.
- supplies.
ANSWER: a
- How many constraints are there in a transshipment problem that has n nodes and m arcs?
- n
- m
- (n + m)
- (m − n)
ANSWER: a
- In a transshipment problem, which of the following statements is a correct representation of the balance-of-flow rule if Total Supply < Total Demand?
- Inflow − Outflow ≥ Supply or Demand
- Inflow + Outflow ≥ Supply or Demand
- Inflow − Outflow ≤ Supply or Demand
- Inflow + Outflow ≤ Supply or Demand
ANSWER: c
- Supply quantities for supply nodes in a transshipment problem are customarily indicated by
- positive numbers.
- negative numbers.
- imaginary numbers.
- either positive or negative numbers.
ANSWER: b
Reviews
There are no reviews yet.