Bounds for strength‐stress interference via mathematical programming

Geung‐Ho Kim

Naval Research Logistics Quarterly, 1981, vol. 28, issue 1, 75-81

Abstract: Problems of bounding Pr {X > Y}, when the distribution of X is subject to certain moment conditions and the distribution of Y is known to be of convexconcave type, are treated in the framework of mathematical programming. Juxtaposed are two programming methods; one is based on the notion of weak duality and the other on the geometry of a certain moment space.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800280105

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:28:y:1981:i:1:p:75-81

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().