A Computational Algorithm for Reliability Bounds in Probabilistic Design

DOI10.1109/TR.1986.4335335MaRDI QIDQ3722247zbMATH OpenFDO

Authors Jin Won Park, Gordon M. Clark

Publication date 1986

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TR.1986.4335335

zbMATH Keywords

boundsdesign reliability

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Quadratic programming (90C20) Applications of mathematical programming (90C90)

Recommendations

• Determination of reliability bounds for structural systems using linear programming
• scientific article; zbMATH DE number 1984140
• An efficient algorithm to solve integer-programming problems arising in system-reliability design
• Engineering design under imprecise probabilities: computational complexity
• A branch and bound algorithm for designing reliable systems at a minimum cost

Cited in

(3)

• Reachability design through approximate Bayesian computation
• Engineering design under imprecise probabilities: computational complexity
• A practical bounding algorithm for computing two-terminal reliability based on decomposition technique

This page was built for publication: A Computational Algorithm for Reliability Bounds in Probabilistic Design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722247)