In Example 6.3-6, use LP to determine the shortest routes between the following pairs of nodes: (a)

Question:

In Example 6.3-6, use LP to determine the shortest routes between the following pairs of nodes:

(a) Node 1 to node 5.

(b) Node 2 to node 5.


Example 6.3-6

In the network of Example 6.3-4, determine the shortest route from node 1 to node 2—that is, s = 1 and t = 2. Figure 6.16 shows a unit flow entering node s = 1 and leaving node t = 2. The associated flow-conservation equations are (verify!):


FIGURE 6.16

Insertion of unit flow to determine shortest route between node s = 1 and node t = 2

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: