Show simple item record

contributor authorJunho Song
contributor authorArmen Der Kiureghian
date accessioned2017-05-08T22:40:06Z
date available2017-05-08T22:40:06Z
date copyrightJune 2003
date issued2003
identifier other%28asce%290733-9399%282003%29129%3A6%28627%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/85747
description abstractBounds on system probability in terms of marginal or joint component probabilities are of interest when exact solutions cannot be obtained. Currently, bounding formulas employing unicomponent probabilities are available for series and parallel systems, and formulas employing bi- and higher-order component probabilities are available for series systems. No theoretical formulas exist for general systems. It is shown in this paper that linear programming (LP) can be used to compute bounds for any system for any level of information available on the component probabilities. Unlike the theoretical bicomponent and higher-order bounds, the LP bounds are independent of the ordering of the components and are guaranteed to produce the narrowest possible bounds for the given information. Furthermore, the LP bounds can incorporate any type of information, including an incomplete set of component probabilities or inequality constraints on component probabilities. Numerical examples involving series, parallel and general structural systems are used to demonstrate the methodology.
publisherAmerican Society of Civil Engineers
titleBounds on System Reliability by Linear Programming
typeJournal Paper
journal volume129
journal issue6
journal titleJournal of Engineering Mechanics
identifier doi10.1061/(ASCE)0733-9399(2003)129:6(627)
treeJournal of Engineering Mechanics:;2003:;Volume ( 129 ):;issue: 006
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record