Lifting inequalities: a framework for generating strong cuts for nonlinear programs
From MaRDI portal
Publication:847822
DOI10.1007/s10107-008-0226-9zbMath1184.90130OpenAlexW1997826608MaRDI QIDQ847822
Jean-Philippe P. Richard, Mohit Tawarmalani
Publication date: 19 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0226-9
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, Cutting planes for the multistage stochastic unit commitment problem, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Deriving convex hulls through lifting and projection, On interval-subgradient and no-good cuts, A graph-based decomposition method for convex quadratic optimization with indicators, Lifting for conic mixed-integer programming, Supermodularity and valid inequalities for quadratic optimization with indicators, Explicit convex and concave envelopes through polyhedral subdivisions, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Strong formulations for conic quadratic optimization with indicator variables, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Ideal formulations for constrained convex optimization problems with indicator variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Box-constrained quadratic programs with fixed charge variables
- Valid inequalities and separation for uncapacitated fixed charge networks
- A new reformulation-linearization technique for bilinear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- The 0-1 knapsack problem with a single continuous variable
- Convex extensions and envelopes of lower semi-continuous functions
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- On the facets of the mixed-integer knapsack polyhedron
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- A polyhedral study of nonconvex quadratic programs with box constraints
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Sequence independent lifting in mixed integer programming
- Sequence independent lifting for mixed integer programs with variable upper bounds
- Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Solving Large-Scale Zero-One Linear Programming Problems
- Valid Linear Inequalities for Fixed Charge Problems
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- On the facial structure of set packing polyhedra
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Convex Analysis
- Facets of the Complementarity Knapsack Polytope
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Flow pack facets of the single node fixed-charge flow polytope
