Upper bounds of degree 3 for the probability of the union of events via linear programming
From MaRDI portal
(Redirected from Publication:1028488)
Recommendations
- Linear programming bounds on the union probability
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- scientific article; zbMATH DE number 1748521
- Graph-based upper bounds for the probability of the union of events
- Polynomially computable bounds for the probability of the union of events
- Sharp Bounds on Probabilities Using Linear Programming
- New Bounds of the Probability of a Union
- Upper bounds for the probability of a union by multitrees
- Lower Bounds for the Probability of Intersection of Several Unions of Events
Cited in
(10)- The value of shape constraints in discrete moment problems: a review and extension
- Inequalities for discrete higher order convex functions
- New upper bounds on the probability of events based on graph structures
- Graph-based upper bounds for the probability of the union of events
- Computing bounds for the probability of the union of events by different methods
- Sharp bounds for the probability of the union of events under unimodality condition
- Polynomially computable bounds for the probability of the union of events
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Complexity of some graph-based bounds on the probability of a union of events
This page was built for publication: Upper bounds of degree 3 for the probability of the union of events via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028488)
