Maximum Reliability Route Subject to k-Improvements in a Directed Network

The network consists of links and perfect nodes. Each link has several known reliability numbers associated with it; each reliability number is related to the number of improvements made on that link. The network reliability is to be maximised subject to a constraint on the sum of the number of link improvements, by finding the appropriate route through the network. Dynamic programming is used to solve the problem. A numerical example illustrates the solution.