On mixing sets arising in chance-constrained programming
This article considers chance-constrained, mixed-integer programming problems with knapsack constraints. The first section outlines the background to this problem including the practical applications, survey of the literature and preliminary definitions of chance-constrained problems. The second section introduces mixing sets that are relevant to chance-constrained problems with a knapsack constraint and presents useful background properties of these sets. This is followed by a section containing the proposed valid inequalities for the mixing set with a cardinality constraint. The author also derives necessary and sufficient conditions for these inequalities to be facet defining for the convex hull defined by the solutions. A polynomial time, exact separation algorithm for these inequalities is also provided. The fourth section then describes an alternative, polynomial size, formulation for the same problem, which is based on disjunctive programming and is an improvement to the current non-polynomial formulation where the constraints can be separated in polynomial time. The results presented in the previous sections are extended in section 5, where the mixing set is combined with a knapsack constraint. Valid inequalities are provided and proven for this case too. The next section describes the problem of combining mixing sets using a blending approach with a cardinality or knapsack constraint, and a useful example of how the proposed alternative reformulation works in practice is given. This very interesting article concludes with a section containing the results of computational experimentation, consisting of lot-sizing problems solved in a branch-and-cut framework, which demonstrates the efficiency in using the proposed valid inequalities for this type of problems.
- On the mixing set with a knapsack constraint
- Mixed integer linear programming formulations for probabilistic constraints
- 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
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
- A branch and bound method for stochastic integer problems under probabilistic constraints
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
- An integer programming approach for linear programs with probabilistic constraints
- Chance Constrained Programming with Joint Constraints
- Compact formulations as a union of polyhedra
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Contributions to the theory of stochastic programming
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- MIP reformulations of the probabilistic set covering problem
- Mixing mixed-integer inequalities
- On the dimension of projected polyhedra
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Relaxations for probabilistically constrained programs with discrete random variables
- Strong formulations of robust mixed 0-1 programming
- The Continuous Mixing Polyhedron
- The mixed vertex packing problem.
- The Mixing Set with Flows
- The mixing-MIR set with divisible capacities
- The Probabilistic Set-Covering Problem
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Valid inequalities for mixed integer linear programs
- A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand
- Relaxations and approximations of chance constraints under finite distributions
- Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design
- A polyhedral study on chance constrained program with random right-hand side
- A polyhedral study of the static probabilistic lot-sizing problem
- (Sub-)differentiability of probability functions with elliptical distributions
- Cell-and-bound algorithm for chance constrained programs with discrete distributions
- On quantile cuts and their closure for chance constrained optimization problems
- Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection
- An adaptive model with joint chance constraints for a hybrid wind-conventional generator system
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
- 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
- Generalized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex sets
- Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty
- On the chance-constrained minimum spanning \(k\)-core problem
- A linear programming approach for linear programs with probabilistic constraints
- On intersection of two mixing sets with applications to joint chance-constrained programs
- An algorithm for binary linear chance-constrained problems using IIS
- Derivatives of probability functions: unions of polyhedra and elliptical distributions
- Chance-constrained set covering with Wasserstein ambiguity
- Constrained optimization with stochastic feasibility regions applied to vehicle path planning
- Mixed integer linear programming formulation techniques
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Risk-averse shortest path interdiction
- An improved convex 0-1 quadratic program reformulation for chance-constrained quadratic knapsack problems
- On the mixing set with a knapsack constraint
- Decomposition algorithms for two-stage chance-constrained programs
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
- Chance-Constrained Binary Packing Problems
- Covering linear programming with violations
- Data-driven chance constrained stochastic program
- On the quantile cut closure of chance-constrained problems
- Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization
- Using integer programming for balancing return and risk in problems with individual chance constraints
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Mixed integer linear programming formulations for probabilistic constraints
- Tight second stage formulations in two-stage stochastic mixed integer programs
- Probabilistic partial set covering with an oracle for chance constraints
- A sequential algorithm for solving nonlinear optimization problems with chance constraints
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
- On the convexity of level-sets of probability functions
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- Generalized differentiation of probability functions acting on an infinite system of constraints
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
- Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory
- Statistical performance of subgradient step-size update rules in Lagrangian relaxations of chance-constrained optimization models
- Value of risk aversion in perishable products supply chain management
- An empirical quantile estimation approach for chance-constrained nonlinear optimization problems
- Valid inequalities for the -edge disruptor problem
- Adaptive partitioning for chance-constrained problems with finite support
- A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Solving joint chance constrained problems using regularization and Benders' decomposition
- A discussion of probability functions and constraints from a variational perspective
This page was built for publication: On mixing sets arising in chance-constrained programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429465)
