Exam 8: Network Optimization Models

The maximum flow in a network will always be less than or equal to the minimum of the minimum of the total capacity of the branches leaving the source or entering the sink.

In the shortest route algorithm discussed in the textbook, backtracking means

What is not true in the shortest path algorithm discussed in the textbook?

The objective in a minimal spanning tree problem is to find the least cost way of connecting all nodes to the origin or destination.

Shortest round trip distances from origin to destination using shortest route problem is (mark what is true)

The shortest path algorithm given in the text will work even if the costs (distances) of the arcs are negative.

-In Figure 1, using the shortest route algorithm presented in the text book, the node that would be labeled with a permanent label next will be

In the minimal spanning tree algorithm given in the text, the length of the spanning tree will differ depending upon the starting node used in the algorithm.

-In Figure 2a, using the shortest route algorithm presented in the text book, the shortest distance from node 1 to node 6 will be

In the shortest path algorithm given in the text, when the procedure is completed, the shortest paths from starting node to all other nodes have been found.

In the minimal spanning tree algorithm given in the text, the algorithm is finished and a solution is found when all arcs have been included in the minimal spanning tree.

-In Figure 2b, using backtracking step of the shortest route algorithm, the shortest route from node 1 to node 6 is

Flow conservation is assumed in the spanning tree problem.

-In Figure 1, using the shortest route algorithm presented in the text book, the shortest path from node 1 to node 6 is

-In Figure 3b, what are the arcs in the minimal spanning tree found by using the minimum spanning tree algorithm presented in the text?

The maximum flow in a network will always be equal to the minimum of the minimum of the total capacity of the branches leaving the source or entering the sink.

What is not true in the shortest path algorithm discussed in the textbook?

In the shortest route problem, the algorithm will find all shortest paths from any node to any node.

Greedy algorithm finds the optimal solution in the minimal spanning tree problem.

In solving the shortest path problem by using a linear programming formulation and excel, we add a very high (dummy) cost corresponding to all non-existing arcs so that they will not be in the solution.