Abstract
A fast incremental algorithm is applied to allocate a resource to a selected set of failure events in a tree with all events different and small failure transition probabilities described by convex functions of the allocations. The objective is to minimize the probability of a terminal failure. The incremental algorithm gives an optimal solution under given conditions; otherwise, it is combined with a dynamic programming algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
