Example - Most Reliable Path 0.8 0.35 0.2 10.6 • Consider the following network where the values on arcs represent Pij,
Posted: Wed Apr 27, 2022 1:25 pm
Example - Most Reliable Path 0.8 0.35 0.2 10.6 • Consider the following network where the values on arcs represent Pij, the probability that arc(ij) can be traversed successfully. Formulate the problem of finding the most reliable path from node 1 to node 6 as a shortest path problem. 0.1 0.4 09 0.3 025 . Maximize the probability that the path from 1 to 6 is successfully traversed