On mixing sets arising in chance-constrained programming

DOI10.1007/s10107-010-0385-3zbMath1262.90110OpenAlexW2151140685MaRDI QIDQ2429465

Simge Küçükyavuz

Publication date: 27 April 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0385-3

zbMATH Keywords

mixed-integer programmingfacetscomputationchance constraintslot-sizingcompact extended formulations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (55)

Solving joint chance constrained problems using regularization and Benders' decomposition ⋮ Constrained optimization with stochastic feasibility regions applied to vehicle path planning ⋮ A discussion of probability functions and constraints from a variational perspective ⋮ 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 ⋮ Data-driven chance constrained stochastic program ⋮ Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty ⋮ A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand ⋮ Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization ⋮ On the Quantile Cut Closure of Chance-Constrained Problems ⋮ 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 ⋮ Using integer programming for balancing return and risk in problems with individual chance constraints ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ Chance-Constrained Binary Packing Problems ⋮ Covering Linear Programming with Violations ⋮ Derivatives of probability functions: unions of polyhedra and elliptical distributions ⋮ 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 ⋮ An algorithm for binary linear chance-constrained problems using IIS ⋮ A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support ⋮ Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ 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 ⋮ Chance-constrained set covering with Wasserstein ambiguity ⋮ Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory ⋮ Mixed integer linear programming formulations for probabilistic constraints ⋮ Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ (Sub-)differentiability of probability functions with elliptical distributions ⋮ Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data ⋮ Probabilistic Partial Set Covering with an Oracle for Chance Constraints ⋮ A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints ⋮ On the Convexity of Level-sets of Probability Functions ⋮ An adaptive model with joint chance constraints for a hybrid wind-conventional generator system ⋮ Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs ⋮ Cell-and-bound algorithm for chance constrained programs with discrete distributions ⋮ Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems ⋮ On the chance-constrained minimum spanning \(k\)-core problem ⋮ Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information ⋮ On quantile cuts and their closure for chance constrained optimization problems ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Branch-and-cut approaches for chance-constrained formulations of reliable network design problems ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Risk-Averse Shortest Path Interdiction ⋮ Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints ⋮ Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs ⋮ AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK 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 ⋮ Generalized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex sets ⋮ A linear programming approach for linear programs with probabilistic constraints

Cites Work

• Unnamed Item
• MIP reformulations of the probabilistic set covering problem
• An integer programming approach for linear programs with probabilistic constraints
• Compact formulations as a union of polyhedra
• The mixing-MIR set with divisible capacities
• Valid inequalities for mixed integer linear programs
• Relaxations for probabilistically constrained programs with discrete random variables
• On the dimension of projected polyhedra
• Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Strong formulations of robust mixed 0-1 programming
• A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
• An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
• The Mixing Set with Flows
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• The Probabilistic Set-Covering Problem
• A branch and bound method for stochastic integer problems under probabilistic constraints
• 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
• Chance Constrained Programming with Joint Constraints
• The Continuous Mixing Polyhedron
• 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: On mixing sets arising in chance-constrained programming