Abstract

This paper studies one aspect of the robustness of optimal solutions to the \textit{maximally reliable path} and investigates the infimum and supremum multiplicative perturbations each individual arc can tolerate preserving the optimality of a given optimal path. When such marginal values are to be determined simultaneously for all arcs in a network, considerable duplication of effort can be avoided through the use of our proposed approach.

This work is licensed under a Creative Commons Attribution 4.0 License.