A polyhedral study on chance constrained program with random right-hand side
From MaRDI portal
Publication:1683680
DOI10.1007/s10107-016-1103-6zbMath1386.90089OpenAlexW2565581500MaRDI QIDQ1683680
Publication date: 1 December 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-1103-6
Related Items (14)
Solving joint chance constrained problems using regularization and Benders' decomposition ⋮ Relaxations and approximations of chance constraints under finite distributions ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ On intersection of two mixing sets with applications to joint chance-constrained programs ⋮ A polyhedral study on chance constrained program with random right-hand side ⋮ New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory ⋮ Probabilistic Partial Set Covering with an Oracle for Chance Constraints ⋮ On quantile cuts and their closure for chance constrained optimization problems ⋮ Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens ⋮ Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity ⋮ Problem-based optimal scenario generation and reduction in stochastic programming
Cites Work
- Unnamed Item
- On the mixing set with a knapsack constraint
- Decomposition algorithms for two-stage chance-constrained programs
- Nonlinear chance constrained problems: optimality conditions, regularization and solvers
- Cut generation for optimization problems with multivariate risk constraints
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- MIP reformulations of the probabilistic set covering problem
- An integer programming approach for linear programs with probabilistic constraints
- The mixing-MIR set with divisible capacities
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Mathematical programming approaches for generating \(p\)-efficient points
- Convexity of chance constraints with independent random variables
- Relaxations for probabilistically constrained programs with discrete random variables
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- A polyhedral study on chance constrained program with random right-hand side
- Designing robust emergency medical service via stochastic programming
- Sequence independent lifting in mixed integer programming
- On joint probabilistic constraints with Gaussian coefficient matrix
- Joint chance constrained programming for hydro reservoir management
- On mixing sets arising in chance-constrained programming
- Sequential pairing of mixed integer inequalities
- A note on the continuous mixing set
- Ensuring service levels in routing problems with time windows and stochastic travel times
- Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities
- A Gradient Formula for Linear Chance Constraints Under Gaussian Distribution
- Covering Linear Programming with Violations
- Easily Computable Facets of the Knapsack Polytope
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- The Probabilistic Set-Covering Problem
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- Gradient Formulae for Nonlinear Probabilistic Constraints with Gaussian and Gaussian-Like Distributions
- Structural properties of linear probabilistic constraints
- Convex Approximations of Chance Constrained Programs
- The mixed vertex packing problem.
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Mixing mixed-integer inequalities
This page was built for publication: A polyhedral study on chance constrained program with random right-hand side
