A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in Directed Acyclic Graphs and reliability
Stéphane Chrétien and
Franck Corset
Statistics & Probability Letters, 2016, vol. 117, issue C, 221-230
Abstract:
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.
Keywords: Random networks; Random linear programming; Reliability; Maintenance; Dyer–Frieze–McDiarmid’s inequality; Shortest path (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715216300827
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:117:y:2016:i:c:p:221-230
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01
DOI: 10.1016/j.spl.2016.06.001
Access Statistics for this article
Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul
More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().