Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints

DOI10.1007/s10479-014-1712-5zbMath1309.90071OpenAlexW23111623MaRDI QIDQ2341243

Eren Erman Ozguven, Merve Unuvar, Prékopa, András

Publication date: 23 April 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1712-5

zbMATH Keywords

optimizationprobabilistic modelingboundingbi-section algorithm

Mathematics Subject Classification ID

Stochastic programming (90C15)

Related Items (2)

Improved bounds on the probability of the union of events some of whose intersections are empty ⋮ Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Graph-based upper bounds for the probability of the union of events
• Hypertrees and Bonferroni inequalities
• The bisection method in higher dimensions
• Probability Bounds with Cherry Trees
• Sharp Bounds on Probabilities Using Linear Programming
• New upper bounds on the probability of events based on graph structures
• Boole-Bonferroni Inequalities and Linear Programming
• Bounds on the probability of the union and intersection of m events
• An upper bound for the probability of a union
• Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
• Probability bounds given by hypercherry trees
• An Inequality for Probabilities
• A class of stochastic programming decision problems

This page was built for publication: Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints