Engineering design under imprecise probabilities: computational complexity

DOI10.4067/S0719-06462011000100007MaRDI QIDQ3172338zbMATH OpenFDO

Authors Vladik Kreinovich

Publication date 5 October 2011

Published in Cubo (Temuco) (Search for Journal in Brave)

zbMATH Keywords

computational complexityimprecise probabilityNP-hardinterval uncertaintyengineering designp-boxesbackcalculation

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30)

Recommendations

• scientific article; zbMATH DE number 1568995
• A Computational Algorithm for Reliability Bounds in Probabilistic Design
• Probability boxes on totally preordered spaces for multivariate modelling
• Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
• Optimization under consideration of uncertain input quantities

Cited in

(3)

• Probabilistic optimization of engineering system with prescribed target design in a reduced parameter space
• A Computational Algorithm for Reliability Bounds in Probabilistic Design
• Engineering design under uncertainty and health prognostics

This page was built for publication: Engineering design under imprecise probabilities: computational complexity

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