disjunctive cuts

Disjunctive cuts for non-convex MINLP

  • Pietro Belotti
    • Categories (Mixed) Integer Nonlinear Programming Tags , , ,

    Mixed Integer Nonlinear Programming (MINLP) problems present two main challenges: the integrality of a subset of variables and nonconvex (nonlinear) objective function and constraints. Many exact solvers for MINLP are branch-and-bound algorithms that compute a lower bound on the optimal solution using a linear programming relaxation of the original problem. In order to solve these … Read more

    Valid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints

  • Nilay Noyan
  • Andrzej Ruszczyński
    • Categories Stochastic Programming Tags , , ,

    Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into stochastic optimization problems as constraints. In the discrete case, stochastic optimization models involving second order stochastic dominance (SSD) constraints can be solved by linear programming (LP). However, problems involving first order stochastic dominance … Read more