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

On bounding the union probability using partial weighted information

Author

Listed:
  • Yang, Jun
  • Alajaji, Fady
  • Takahara, Glen

Abstract

Lower bounds on the finite union probability are established in terms of the individual event probabilities and a weighted sum of the pairwise event probabilities. The lower bounds have at most pseudo-polynomial computational complexity and generalize recent analytical bounds.

Suggested Citation

  • Yang, Jun & Alajaji, Fady & Takahara, Glen, 2016. "On bounding the union probability using partial weighted information," Statistics & Probability Letters, Elsevier, vol. 116(C), pages 38-44.
    • Handle: RePEc:eee:stapro:v:116:y:2016:i:c:p:38-44
    DOI: 10.1016/j.spl.2016.04.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715216300323
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2016.04.017?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. Shabbir Ahmed & Dimitri J. Papageorgiou, 2013. "Probabilistic Set Covering with Correlations," Operations Research, INFORMS, vol. 61(2), pages 438-452, April.
    2. Frolov, Andrei N., 2012. "Bounds for probabilities of unions of events and the Borel–Cantelli lemma," Statistics & Probability Letters, Elsevier, vol. 82(12), pages 2189-2197.
    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. Stepanov, Alexei, 2014. "On the use of the Borel–Cantelli lemma in Markov chains," Statistics & Probability Letters, Elsevier, vol. 90(C), pages 149-154.
    2. Alper Atamtürk & Andrés Gómez, 2017. "Maximizing a Class of Utility Functions Over the Vertices of a Polytope," Operations Research, INFORMS, vol. 65(2), pages 433-445, March-Apr.
    3. Liu, Kanglin & Zhang, Hengliang & Zhang, Zhi-Hai, 2021. "The efficiency, equity and effectiveness of location strategies in humanitarian logistics: A robust chance-constrained approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    4. Frolov, Andrei N., 2017. "On inequalities for values of first jumps of distribution functions and Hölder’s inequality," Statistics & Probability Letters, Elsevier, vol. 126(C), pages 150-156.
    5. Mahdi Noorizadegan & Abbas Seifi, 2018. "An efficient computational method for large scale surgery scheduling problems with chance constraints," Computational Optimization and Applications, Springer, vol. 69(2), pages 535-561, March.
    6. Gianpiero Canessa & Julian A. Gallego & Lewis Ntaimo & Bernardo K. Pagnoncelli, 2019. "An algorithm for binary linear chance-constrained problems using IIS," Computational Optimization and Applications, Springer, vol. 72(3), pages 589-608, April.
    7. Zhouchun Huang & Qipeng P. Zheng & Eduardo L. Pasiliao & Daniel Simmons, 2017. "Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios," Annals of Operations Research, Springer, vol. 249(1), pages 141-162, February.
    8. Frolov, Andrei N., 2021. "On upper and lower bounds for probabilities of combinations of events," Statistics & Probability Letters, Elsevier, vol. 173(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:116:y:2016:i:c:p:38-44. 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.