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}
}
  • J. Richard, Mohit Tawarmalani
  • Published 2010
  • Computer Science, Mathematics
  • Mathematical Programming
  • 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
    Lifting for conic mixed-integer programming
    • 59
    • Open Access
    KRANNERT SCHOOL OF MANAGEMENT

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 55 REFERENCES
    Sequence Independent Lifting in Mixed Integer Programming
    • 122
    • Open Access
    Lifted flow cover inequalities for mixed 0-1 integer programs
    • 146
    • Open Access
    Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
    • 56
    • Highly Influential
    • Open Access
    Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds
    • 23
    • Highly Influential
    Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting
    • 34
    Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms
    • 17
    A hierarchy of relaxation between the continuous and convex hull representations
    • 693