Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 221

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Bounds on System Reliability by Linear Programming

Song, Junho, Der Kiureghian, Armen · 2003 · Journal of Engineering Mechanics
DOI 10.1061/(asce)0733-9399(2003)129:6(627

Abstract

Bounds 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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1061/(asce)0733-9399(2003)129:6(627)

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 221

Metadata

Authors
Song, J., & Der Kiureghian, A.
Venue
Journal of Engineering Mechanics
Published
2003-06
Volume
129
Issue
6
Pages
627-636
ISSN
  • 0733-9399 (ISSN-L)
  • 1943-7889
DOI
10.1061/(asce)0733-9399(2003)129:6(627
OpenAlex
W2161824526
Cited by
221
References
1
FWCI
17.44
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Bounds on System Reliability by Linear Programming. https://app.cochat.ai/papers/10.1061/(asce)0733-9399(2003)129:6(627
The paper
Song, J., & Der Kiureghian, A. (2003). Bounds on System Reliability by Linear Programming. Journal of Engineering Mechanics. https://doi.org/10.1061/(asce)0733-9399(2003)129%3A6(627

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.