Sharp Bounds on Probabilities Using Linear Programming
From MaRDI portal
Publication:3351136
DOI10.1287/opre.38.2.227zbMath0727.90049OpenAlexW2127814853WikidataQ93609425 ScholiaQ93609425MaRDI QIDQ3351136
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.38.2.227
Applications of mathematical programming (90C90) Linear programming (90C05) Foundations of probability theory (60A99)
Related Items (32)
New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions ⋮ On the relationship between the discrete and continuous bounding moment problems and their numerical solutions ⋮ Analysis and optimization of recruitment stocking problems ⋮ Hypergraphs and sharpened sieve inequalities ⋮ An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization 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 ⋮ Strengthened bounds for the probability of \(k\)-out-of-\(n\) events ⋮ Tight Probability Bounds with Pairwise Independence ⋮ Computing bounds for the probability of the union of events by different methods ⋮ Monge properties, discrete convexity and applications ⋮ Properties and calculation of multivariate risk measures: MVaR and MCVaR ⋮ The discrete moment problem with fractional moments ⋮ 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 ⋮ Robust newsvendor problems with compound Poisson demands ⋮ Bounding the values of financial derivatives by the use of the moment problem ⋮ Upper and lower bounds for the probability that r events occur ⋮ A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality ⋮ Bounding the probability of the union of events by aggregation and disaggregation in linear programs ⋮ A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs ⋮ Improved bounds on the probability of the union of events some of whose intersections are empty ⋮ Bounds for probabilistic programming with application to a blend planning problem ⋮ The Discrete Moment Problem with Nonconvex Shape Constraints ⋮ Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations ⋮ Robust newsvendor problems: effect of discrete demands ⋮ AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS ⋮ Approximating two-stage chance-constrained programs with classical probability bounds ⋮ Polynomially Computable Bounds for the Probability of the Union of Events ⋮ Bounds for probabilistic integer programming problems ⋮ The value of shape constraints in discrete moment problems: a review and extension ⋮ Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
This page was built for publication: Sharp Bounds on Probabilities Using Linear Programming
