Reference no: EM132226567

1) The objective in most network flow problems is to:

a. Maximize revenue.

b. Minimize the number of decision variables.

c. Maximize profits.

d. Minimize the total cost, distance, or penalty that must be incurred to solve the problem.

2) The balance of flow constraints:

a. Define a relationship between inflow and outflow for each node in a network.

b. Are of ≤ type.

c. Are of = type.

d. Are of ≥ type.

3) The problem, in which we need to determine the shortest (or least costly) route or path through a network from a starting node to an ending node is called:

a. The assignment problem.

b. The path problem.

c. The transportation problem.

d. The generalized network flow problem.

4) In a typical path problem, the supply node flow constraint RHS is equal to:

a. +1.

b. -1.

c. 2.

d. 0.

5) If you use the simplex method to solve any minimum cost network flow model having integer constraint RHS values, then:

a. The optimal solution automatically assumes integer values.

b. The problem cannot be solved using network modeling.

c. The problem is infeasible.

d. Additional 0-1 variables are needed to model this situation.