Relaxations for probabilistically constrained stochastic programming problems: review and extensions
From MaRDI portal
Cites work
- A gradient formula for linear chance constraints under Gaussian distribution
- An Improved Algorithm for Network Reliability
- An improved Bonferroni inequality and applications
- An upper bound for the probability of a union
- Applications of Stochastic Programming
- Bounds on the probability of the union and intersection of m events
- Chance Constrained Programming with Joint Constraints
- Computation of multivariate normal and t probabilities
- Computer safety, reliability and security. 21st international conference, SAFECOMP 2002, Catania, Italy, September 10--13, 2002. Proceedings.
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Concepts of Setwise Dependence
- Contributions to the theory of stochastic programming
- Convex Approximations of Chance Constrained Programs
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- scientific article; zbMATH DE number 995813 (Why is no real title available?)
- scientific article; zbMATH DE number 4083369 (Why is no real title available?)
- scientific article; zbMATH DE number 4089322 (Why is no real title available?)
- scientific article; zbMATH DE number 3743019 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 3365056 (Why is no real title available?)
- scientific article; zbMATH DE number 958673 (Why is no real title available?)
- Joint dynamic probabilistic constraints with projected linear decision rules
- Log-concave probability and its applications
- Log-concavity property for some well-known distributions
- Mathematical programming approaches for generating p-efficient points
- MIP reformulations of the probabilistic set covering problem
- On the concavity of multivariate probability distribution functions
- Pattern definition of the \(p\)-efficiency concept
- Pattern-based modeling and solution of probabilistically constrained optimization problems
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Regularization methods for optimization problems with probabilistic constraints
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Subroutines for computing normal probabilities of sets -- computer experiences
- Symmetry in integer linear programming
- The use of discrete moment bounds in probabilistic constrained stochastic programming models
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
This page was built for publication: Relaxations for probabilistically constrained stochastic programming problems: review and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880167)
