BUS461 Week 3 Quiz

BUS461 Week 3 Quiz

1.    Question :    In a maximal flow problem:

Multiple sources may be accommodated, but multiple sinks may not.

Arc capacities must be the same in either direction.

There are several different linear programming formulations for the model.

The connected arcs may contain no cycles.

 

2.    Question :    A PERT/CPM network can be represented as a linear programming model by letting the decision variables be the activity start times.

True
False

 

3.    Question :    Which of the following is true about an intermediate node in a transshipment problem?

The net flow out must be zero.

The node must connect to at least one supply node and at least one demand node.
The number of arcs connected to supply nodes must be less than or equal to the number of arcs connected to demand nodes.
The total capacity of outbound arcs must equal the total capacity of inbound arcs.

Points Received:    0 of 1
Comments:

4.    Question :    Any attempt at resource leveling always will involve lengthening the project completion time beyond its “non-leveled” minimum.

True
False

 

5.    Question :    Minimal spanning tree problems do not lend themselves to a convenient linear programming formulation. (True, medium)

 True
False

 

6.    Question :    A B-1 bomber must fly through a choice of “safe areas,” deliver its bombing payload, and return to its home base using minimum fuel. Which network model would be the most appropriate representation?

Shortest path

Minimal spanning tree

Traveling salesman

Transportation

 

7.    Question :    In which of the following network models is it not possible to “ship” both in and out of a given node?

Transshipment

Traveling salesman

Maximal flow

Assignment

 

8.    Question :    An environmental impact report for a proposed new industrial center complex must include the total amount of sewage that can be pumped through existing pipes. Which network model would be the most appropriate representation?

Shortest path

Minimal spanning tree

Traveling salesman

Maximal flow

 

9.    Question :    You can solve the traveling salesman problem by selecting a cycle with the lowest cost.

True
False

 

10.    Question :    Using the Critical Path Method, the normal time to complete activity D is 10 weeks, and its normal cost is $500. Under maximum crashing, activity D can be completed is 4 weeks for $2,300. Therefore, if $1,100 is spent on activity D, its completion time will be 6 weeks.

True
False