Pages that link to "Item:Q3351136"

The following pages link to Sharp Bounds on Probabilities Using Linear Programming (Q3351136):

Displaying 37 items.

• On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
• A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality (Q535064) (← links)
• Probabilistic complexity analysis for linear problems in bounded domains (Q757053) (← links)
• Analysis and optimization of recruitment stocking problems (Q828830) (← links)
• Strengthened bounds for the probability of \(k\)-out-of-\(n\) events (Q897611) (← links)
• Upper bounds of degree 3 for the probability of the union of events via linear programming (Q1028488) (← links)
• Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations (Q1042067) (← links)
• Hypergraphs and sharpened sieve inequalities (Q1336651) (← links)
• On the probability of union in the $n$-space (Q1727940) (← links)
• Computing the probability of union in the $n$-dimensional Euclidean space for application of the multivariate quantile: $p$-level efficient points (Q1728220) (← links)
• Bounding the probability of the union of events by aggregation and disaggregation in linear programs (Q1765524) (← links)
• Improved bounds on the probability of the union of events some of whose intersections are empty (Q1785461) (← links)
• Bounds for probabilistic integer programming problems (Q1850114) (← links)
• Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
• Polynomial bases on the numerical solution of the multivariate discrete moment problem (Q1931645) (← links)
• Computing bounds for the probability of the union of events by different methods (Q1945070) (← links)
• Bounds for probabilistic programming with application to a blend planning problem (Q2060407) (← links)
• The value of shape constraints in discrete moment problems: a review and extension (Q2095900) (← links)
• Robust newsvendor problems with compound Poisson demands (Q2241144) (← links)
• Bounding the values of financial derivatives by the use of the moment problem (Q2241580) (← links)
• Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known (Q2303530) (← links)
• Robust newsvendor problems: effect of discrete demands (Q2327693) (← links)
• Approximating two-stage chance-constrained programs with classical probability bounds (Q2329660) (← links)
• Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints (Q2341243) (← links)
• New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions (Q2357784) (← links)
• Monge properties, discrete convexity and applications (Q2432877) (← links)
• Properties and calculation of multivariate risk measures: MVaR and MCVaR (Q2449353) (← links)
• The discrete moment problem with fractional moments (Q2450764) (← links)
• A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs (Q2502217) (← links)
• An improved convex 0-1 quadratic program reformulation for chance-constrained quadratic knapsack problems (Q2846489) (← links)
• Boole-Bonferroni Inequalities and Linear Programming (Q3784915) (← links)
• Closed Form Two-Sided Bounds for Probabilities that At Least <i>r</i> and Exactly <i>r</i> Out of <i>n</i> Events Occur (Q3831789) (← links)
• Upper and lower bounds for the probability that <i>r</i> events occur (Q3835655) (← links)
• The Discrete Moment Problem with Nonconvex Shape Constraints (Q4994156) (← links)
• An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems (Q5085476) (← links)
• Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
• Tight Probability Bounds with Pairwise Independence (Q6158360) (← links)