Boole-Bonferroni Inequalities and Linear Programming

Recommendations

Sharp Bounds on Probabilities Using Linear Programming
Bounding the probability of the union of events by aggregation and disaggregation in linear programs
Sharp bounds for the probability of the union of events under unimodality condition
Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
Polynomially computable bounds for the probability of the union of events

Cited in

(59)

Sublinear upper bounds for stochastic programs with recourse
Approximate inclusion-exclusion
Two-dimensional discrete scan statistics
On the probability of union in the $n$-space
Computing the probability of union in the $n$-dimensional Euclidean space for application of the multivariate quantile: $p$-level efficient points
Bounding the probability of the union of events by aggregation and disaggregation in linear programs
Improved bounds on the probability of the union of events some of whose intersections are empty
Linear regression estimators for multinormal distributions in optimization of stochastic programming problems
Bounds for probabilistic integer programming problems
Continuous approximation schemes for stochastic programs
Polynomial bases on the numerical solution of the multivariate discrete moment problem
Computing bounds for the probability of the union of events by different methods
Bounds for the probability of union of events following monotonic distribution
Bounds for probabilistic programming with application to a blend planning problem
The value of shape constraints in discrete moment problems: a review and extension
Modeling flexible generator operating regions via chance-constrained stochastic unit commitment
Robust newsvendor problems with compound Poisson demands
On bounds for probabilities of combinations of events, the Jordan formula, and the Bonferroni inequalities
Sharp bounds for the probability of union of $n$ events when $m$ number of binomial moments are known
Robust newsvendor problems: effect of discrete demands
Approximating two-stage chance-constrained programs with classical probability bounds
Optimal capacity design under $k$-out-of-$n$ and consecutive $k$-out-of-$n$ type probabilistic constraints
New bounds for the probability that at least $k$-out-of-$n$ events occur with unimodal distributions
Bounds on skyline probability for databases with uncertain preferences
Monge properties, discrete convexity and applications
Properties and calculation of multivariate risk measures: MVaR and MCVaR
The discrete moment problem with fractional moments
Fréchet optimal bounds on the probability of a union with supplementary information
On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
Valid Inequalities for the Pooling Problem with Binary Variables
Sharp Bounds on Probabilities Using Linear Programming
scientific article; zbMATH DE number 4098379 (Why is no real title available?)
Deterministic approximations of probability inequalities
Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
Upper and lower bounds for the probability that r events occur
A numerical method for two-stage stochastic programs under uncertainty
Stochastic ultimate load analysis:models and solution methods¹
Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events
On the analytical-numerical valuation of the Bermudan and American options
The maximal probability that k-wise independent bits are all 1
Determination of reliability bounds for structural systems using linear programming
On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
Polynomially computable bounds for the probability of the union of events
Bounds for increasing multi-state consecutive $k$-out-of-$r$-from-$n$: $F$ system with equal components probabilities
scientific article; zbMATH DE number 2219917 (Why is no real title available?)
Database Support for Data Mining Applications
Tight Probability Bounds with Pairwise Independence
Chance-constrained optimization for contact-rich systems using mixed integer programming
Bounds for the probability of the union of events with unimodality
Sharp bounds for the probability that exactly k-out-of-n events occur with unimodal distributions
Clusters of high-dimensional interval data and related Boolean functions of events in Euclidean space
A generalization of Hunter's bound to hypergraphs
Clusterwise linear regression using a probabilistic branch and bound algorithm under Gaussianity
Exact expressions for the maximal probability that all k-wise independent bits are 1
The discrete moment problem and linear programming
Analysis and optimization of recruitment stocking problems
Strengthened bounds for the probability of $k$-out-of-$n$ events
Probabilistic bounds and algorithms for the maximum satisfiability problem
The effect of redundancy on probability bounds

This page was built for publication: Boole-Bonferroni Inequalities and Linear Programming

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