IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v117y2016icp221-230.html
   My bibliography  Save this article

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

Author

Listed:
  • Chrétien, Stéphane
  • Corset, Franck

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.

Suggested Citation

  • Chrétien, Stéphane & Corset, Franck, 2016. "A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in Directed Acyclic Graphs and reliability," Statistics & Probability Letters, Elsevier, vol. 117(C), pages 221-230.
    • Handle: RePEc:eee:stapro:v:117:y:2016:i:c:p:221-230
    DOI: 10.1016/j.spl.2016.06.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715216300827
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2016.06.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Krokhmal, Pavlo A. & Pardalos, Panos M., 2009. "Random assignment problems," European Journal of Operational Research, Elsevier, vol. 194(1), pages 1-17, April.
    2. Celeux, G. & Corset, F. & Lannoy, A. & Ricard, B., 2006. "Designing a Bayesian network for preventive maintenance from expert opinions in a rapid and reliable way," Reliability Engineering and System Safety, Elsevier, vol. 91(7), pages 849-856.
    3. A. J. Hoffman & H. M. Markowitz, 1963. "A note on shortest path, assignment, and transportation problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 10(1), pages 375-379, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gambelli, Danilo & Alberti, Francesca & Solfanelli, Francesco & Vairo, Daniela & Zanoli, Raffaele, 2017. "Third generation algae biofuels in Italy by 2030: A scenario analysis using Bayesian networks," Energy Policy, Elsevier, vol. 103(C), pages 165-178.
    2. Troyan, Peter, 2024. "(Non-)obvious manipulability of rank-minimizing mechanisms," Journal of Mathematical Economics, Elsevier, vol. 113(C).
    3. Panayotis Mertikopoulos & Heinrich H. Nax & Bary S. R. Pradelski, 2019. "Quick or cheap? Breaking points in dynamic markets," ECON - Working Papers 338, Department of Economics - University of Zurich.
    4. Rafic Faddoul & Wassim Raphael & Abdul-Hamid Soubra & Alaa Chateauneuf, 2013. "Incorporating Bayesian networks in Markov Decision Processes," Post-Print hal-01006963, HAL.
    5. Ortega, Josué & Klein, Thilo, 2022. "Improving Efficiency and Equality in School Choice," QBS Working Paper Series 2022/02, Queen's University Belfast, Queen's Business School.
    6. Kammerdiner, A.R. & Pasiliao, E.L., 2014. "In and out forests on combinatorial landscapes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 78-84.
    7. Ortega, Josué & Klein, Thilo, 2023. "The cost of strategy-proofness in school choice," Games and Economic Behavior, Elsevier, vol. 141(C), pages 515-528.
    8. Michael Z. Spivey, 2011. "Asymptotic Moments of the Bottleneck Assignment Problem," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 205-226, May.
    9. Mădălina M. Drugan, 2015. "Generating QAP instances with known optimum solution and additively decomposable cost function," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1138-1172, November.
    10. Mencaroni, Andrea & Claeys, Dieter & Raa, Birger & De Vuyst, Stijn, 2024. "A quantitative framework to support the decision between traditional, selective, and hybrid assembly," International Journal of Production Economics, Elsevier, vol. 273(C).
    11. Suresh P. Sethi & Sushil Gupta & Vipin K. Agrawal & Vijay K. Agrawal, 2022. "Nobel laureates’ contributions to and impacts on operations management," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4283-4303, December.
    12. Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.
    13. Muller, Alexandre & Suhner, Marie-Christine & Iung, Benoît, 2008. "Formalisation of a new prognosis model for supporting proactive maintenance implementation on industrial system," Reliability Engineering and System Safety, Elsevier, vol. 93(2), pages 234-253.
    14. Chemweno, Peter & Pintelon, Liliane & Van Horenbeek, Adriaan & Muchiri, Peter, 2015. "Development of a risk assessment selection methodology for asset maintenance decision making: An analytic network process (ANP) approach," International Journal of Production Economics, Elsevier, vol. 170(PB), pages 663-676.
    15. Zheng, Yi-Xuan & Xiahou, Tangfan & Liu, Yu & Xie, Chaoyang, 2021. "Structure function learning of hierarchical multi-state systems with incomplete observation sequences," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    16. Mordant, Gilles & Segers, Johan, 2021. "Maxima and near-maxima of a Gaussian random assignment field," Statistics & Probability Letters, Elsevier, vol. 173(C).
    17. Mordant, Gilles & Segers, Johan, 2021. "Maxima and near-maxima of a Gaussian random assignment field," LIDAM Discussion Papers ISBA 2021008, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    18. Panayotis Mertikopoulos & Heinrich H. Nax & Bary S. R. Pradelski, 2019. "Quick or Cheap? Breaking Points in Dynamic Markets," Cowles Foundation Discussion Papers 2217, Cowles Foundation for Research in Economics, Yale University.
    19. Kasperski, Adam & Zielinski, Pawel, 2010. "Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights," European Journal of Operational Research, Elsevier, vol. 200(3), pages 680-687, February.
    20. Mertikopoulos, Panayotis & Nax, Heinrich H. & Pradelski, Bary S.R., 2024. "Quick or cheap? Breaking points in dynamic markets," Journal of Mathematical Economics, Elsevier, vol. 112(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:117:y:2016:i:c:p:221-230. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.