Intersection Disjunctions for Reverse Convex Sets

DOI10.1287/moor.2021.1132zbMath1492.90097arXiv1901.02112OpenAlexW3204036718MaRDI QIDQ5076701

Eli Towle, James R. Luedtke

Publication date: 17 May 2022

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.02112

zbMATH Keywords

disjunctive programmingvalid inequalitiesconcavity cutsmixed integer nonlinear programmingintersection cutsreverse convex sets

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items (1)

On the implementation and strengthening of intersection cuts for QCQPs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strengthening lattice-free cuts using non-negativity
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• A level set algorithm for a class of reverse convex programs
• On functions representable as a difference of convex functions
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint
• On the use of cuts in reverse convex programs
• A faster strongly polynomial time algorithm for submodular function minimization
• Convex programs with an additional reverse convex constraint
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Linear programs with an additional reverse convex constraint
• Reverse convex programming
• The ellipsoid method and its consequences in combinatorial optimization
• Using separation algorithms to generate mixed integer model reformulations
• Disjunctive programming: Properties of the convex hull of feasible points
• Comments on a reverse convex programming algorithm
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• An algorithm for optimizing network flow capacity under economies of scale
• Characterization of local solutions for a class of nonconvex programs
• Generalized intersection cuts and a new cut generating paradigm
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• \(NP\)-hardness of linear multiplicative programming and related problems
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• On solving general reverse convex programming problems by a sequence of linear programs and line searches
• Convex Sets and Minimal Sublinear Functions
• Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
• Constrained Infinite Group Relaxations of MIPs
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• Intersection Cuts for Bilevel Optimization
• Integer Programming
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• Optimization Problems Subject to a Budget Constraint with Economies of Scale
• Disjunctive Programming
• Polyhedral convexity cuts and negative edge extensions
• Cut-Generating Functions and S-Free Sets
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Integer programming and convex analysis: Intersection cuts from outer polars
• Elementary closures for integer programs.
• Mixing mixed-integer inequalities

This page was built for publication: Intersection Disjunctions for Reverse Convex Sets