monoidal strengthening

Monoidal Strengthening of Simple V-Polyhedral Disjunctive Cuts

  • Aleksandr M. Kazachkov
  • Egon Balas
    • Categories (Mixed) Integer Linear Programming, Cutting Plane Approaches, Integer Programming Tags , , ,

    Disjunctive cutting planes can tighten a relaxation of a mixed-integer linear program. Traditionally, such cuts are obtained by solving a higher-dimensional linear program, whose additional variables cause the procedure to be computationally prohibitive. Adopting a V-polyhedral perspective is a practical alternative that enables the separation of disjunctive cuts via a linear program with only as … Read more

    Intersection cuts for factorable MINLP

  • Felipe Serrano
    • Categories (Mixed) Integer Nonlinear Programming, Global Optimization Tags , ,

    Given a factorable function f, we propose a procedure that constructs a concave underestimor of f that is tight at a given point. These underestimators can be used to generate intersection cuts. A peculiarity of these underestimators is that they do not rely on a bounded domain. We propose a strengthening procedure for the intersection … Read more