A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in Directed Acyclic Graphs and reliability

The paper studies the expectation of the inspection time in complex aging systems, i.e. the length of the shortest path in a Directed Acyclic Graph, with random costs on edges. We give a lower bound for this expectation.