Pages that link to "Item:Q3784915"

The following pages link to Boole-Bonferroni Inequalities and Linear Programming (Q3784915):

Displaying 45 items.

• On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
• A numerical method for two-stage stochastic programs under uncertainty (Q410561) (← links)
• Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events (Q505450) (← links)
• Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities (Q554719) (← links)
• The discrete moment problem and linear programming (Q749441) (← links)
• Analysis and optimization of recruitment stocking problems (Q828830) (← links)
• Strengthened bounds for the probability of \(k\)-out-of-\(n\) events (Q897611) (← links)
• Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
• The effect of redundancy on probability bounds (Q998500) (← links)
• Sublinear upper bounds for stochastic programs with recourse (Q1115346) (← links)
• Approximate inclusion-exclusion (Q1174115) (← links)
• Two-dimensional discrete scan statistics (Q1359700) (← 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)
• Linear regression estimators for multinormal distributions in optimization of stochastic programming problems (Q1806867) (← links)
• Bounds for probabilistic integer programming problems (Q1850114) (← links)
• Continuous approximation schemes for stochastic programs (Q1896441) (← 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 the probability of union of events following monotonic distribution (Q2030441) (← 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)
• Modeling flexible generator operating regions via chance-constrained stochastic unit commitment (Q2221469) (← links)
• Robust newsvendor problems with compound Poisson demands (Q2241144) (← links)
• On bounds for probabilities of combinations of events, the Jordan formula, and the Bonferroni inequalities (Q2289372) (← 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)
• Bounds on skyline probability for databases with uncertain preferences (Q2374521) (← 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)
• Fréchet optimal bounds on the probability of a union with supplementary information (Q2474522) (← links)
• Upper and lower bounds for the probability that <i>r</i> events occur (Q3835655) (← links)
• Stochastic ultimate load analysis:models and solution methods¹ (Q4354849) (← links)
• On the analytical–numerical valuation of the Bermudan and American options (Q5189715) (← links)
• The maximal probability that <i>k</i>‐wise independent bits are all 1 (Q5198667) (← links)
• On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous (Q5245013) (← links)
• Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
• Tight Probability Bounds with Pairwise Independence (Q6158360) (← links)
• Chance-constrained optimization for contact-rich systems using mixed integer programming (Q6551649) (← links)