# Lifting inequalities: a framework for generating strong cuts for nonlinear programs

@article{Richard2010LiftingIA, title={Lifting inequalities: a framework for generating strong cuts for nonlinear programs}, author={J. Richard and Mohit Tawarmalani}, journal={Mathematical Programming}, year={2010}, volume={121}, pages={61-104} }

In this paper, we introduce the first generic lifting techniques for deriving strong globally valid cuts for nonlinear programs. The theory is geometric and provides insights into lifting-based cut generation procedures, yielding short proofs of earlier results in mixed-integer programming. Using convex extensions, we obtain conditions that allow for sequence-independent lifting in nonlinear settings, paving a way for efficient cut-generation procedures for nonlinear programs. This sequence… CONTINUE READING

26 Citations

Strong valid inequalities for orthogonal disjunctions and bilinear covering sets

- Computer Science, Mathematics
- 2010

- 35
- Open Access

Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets

- Computer Science, Mathematics
- 2014

Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints

- Mathematics
- 2012

- 13
- Open Access

Strong formulations for conic quadratic optimization with indicator variables

- Mathematics
- 2020

- 4
- Open Access

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 55 REFERENCES

Sequence Independent Lifting in Mixed Integer Programming

- Computer Science, Mathematics
- 2000

- 122
- Open Access

Lifted flow cover inequalities for mixed 0-1 integer programs

- Computer Science, Mathematics
- 1999

- 146
- Open Access

Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

- Computer Science, Mathematics
- 2003

- 56
- Highly Influential
- Open Access

Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds

- Computer Science, Mathematics
- 2006

- 23
- Highly Influential

Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting

- Computer Science, Mathematics
- 2003

- 34

Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms

- Computer Science, Mathematics
- 2002

- 17

A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems

- Mathematics, Computer Science
- 1994

- 338
- Open Access

A new reformulation-linearization technique for bilinear programming problems

- Mathematics, Computer Science
- 1992

- 354

A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

- Mathematics
- 1998

- 672
- Open Access