Relaxations for probabilistically constrained programs with discrete random variables
From MaRDI portal
Publication:1197883
DOI10.1016/0167-6377(92)90037-4zbMATH Open0765.90071OpenAlexW1990083802MaRDI QIDQ1197883FDOQ1197883
Authors: Suvrajeet Sen 
Publication date: 16 January 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(92)90037-4
Recommendations
- scientific article; zbMATH DE number 433035
- scientific article; zbMATH DE number 1187131
- An integer programming approach for linear programs with probabilistic constraints
- An Integer Programming Approach for Linear Programs with Probabilistic Constraints
- On convex probabilistic programming with discrete distributions.
stochastic linear programsjoint probability constraintsouter convex approximationrandom discretely distributed right-hand sides
Cites Work
- Title not available (Why is that?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- Disjunctive Programming
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization with disjunctive constraints
- Title not available (Why is that?)
- Polyhedral annexation in mixed integer and combinatorial programming
- Title not available (Why is that?)
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- Convexity Cuts and Cut Search
- Facet inequalities from simple disjunctions in cutting plane theory
Cited In (42)
- Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters
- Mathematical programming approaches for generating \(p\)-efficient points
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
- Title not available (Why is that?)
- On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem
- A polyhedral study on chance constrained program with random right-hand side
- A branch and bound method for stochastic integer problems under probabilistic constraints
- General properties of two-stage stochastic programming problems with probabilistic criteria
- Convergence conditions for the observed mean method in stochastic programming
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs
- Decomposition algorithms for two-stage chance-constrained programs
- On the mixing set with a knapsack constraint
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Mixed integer linear programming formulations for probabilistic constraints
- Regularization methods for optimization problems with probabilistic constraints
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- An integer programming approach for linear programs with probabilistic constraints
- MIP reformulations of the probabilistic set covering problem
- Integrated chance constraints: reduced forms and an algorithm
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Relaxations and approximations of chance constraints under finite distributions
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Relaxation schemes for the joint linear chance constraint based on probability inequalities
- On the convergence of sample approximations for stochastic programming problems with probabilistic criteria
- Estimated stochastic programs with chance constraints
- Chance constrained unit commitment approximation under stochastic wind energy
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- Bounds for probabilistic programming with application to a blend planning problem
- On mixing sets arising in chance-constrained programming
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Bounds for probabilistic integer programming problems
- An improved convex 0-1 quadratic program reformulation for chance-constrained quadratic knapsack problems
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Chance constraint programming problems with parameters as exponential random variable
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- A polyhedral study of the static probabilistic lot-sizing problem
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Genetic algorithm based technique for solving chance constrained problems
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
This page was built for publication: Relaxations for probabilistically constrained programs with discrete random variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197883)
