Sharp Bounds on Probabilities Using Linear Programming

Recommendations

Cited in

(46)

Upper bounds of degree 3 for the probability of the union of events via linear programming
Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations
Hypergraphs and sharpened sieve inequalities
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
Bounds for probabilistic integer programming problems
Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic 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 probabilistic programming with application to a blend planning problem
The value of shape constraints in discrete moment problems: a review and extension
Robust newsvendor problems with compound Poisson demands
Bounding the values of financial derivatives by the use of the moment problem
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
Monge properties, discrete convexity and applications
Properties and calculation of multivariate risk measures: MVaR and MCVaR
The discrete moment problem with fractional moments
A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
An improved convex 0-1 quadratic program reformulation for chance-constrained quadratic knapsack problems
Boole-Bonferroni Inequalities and Linear Programming
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
The Discrete Moment Problem with Nonconvex Shape Constraints
An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
scientific article; zbMATH DE number 4193453 (Why is no real title available?)
Polynomially computable bounds for the probability of the union of events
A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
Sharp bounds for the probability of the union of events under unimodality condition
scientific article; zbMATH DE number 3264566 (Why is no real title available?)
scientific article; zbMATH DE number 2219917 (Why is no real title available?)
Tight Probability Bounds with Pairwise Independence
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
Exact expressions for the maximal probability that all k-wise independent bits are 1
Variable aggregation and its effect on union bounding problem
Probabilistic complexity analysis for linear problems in bounded domains
Analysis and optimization of recruitment stocking problems
Strengthened bounds for the probability of $k$-out-of-$n$ events

This page was built for publication: Sharp Bounds on Probabilities Using Linear Programming

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