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

  title={Lifting inequalities: a framework for generating strong cuts for nonlinear programs},
  author={Jean-Philippe P. Richard and Mohit Tawarmalani},
  journal={Math. Program.},
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… CONTINUE READING
12 Citations
40 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 40 references

Convex Analysis

  • R. T. Rockafellar
  • Princeton Mathematical Series. Princeton…
  • 1970
Highly Influential
6 Excerpts

Fundamentals of Convex Analysis

  • Hiriart-Urruty, J.-B., C. Lemaréchal
  • Springer, Heidelberg
  • 2004

Mixed integer programming: a progress report

  • R. E. Bixby, Z. Gu, E. Rothberg, R. Wunderling
  • Grötschel, M. (ed.) The Sharpest Cut: the Impact…
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…