## Algorithms and Software for Convex Mixed Integer Nonlinear Programs

This paper provides a survey of recent progress and software for solving mixed integer nonlinear programs (MINLP) wherein the objective and constraints are defined by convex functions and integrality restrictions are imposed on a subset of the decision variables. Convex MINLPs have received sustained attention in very years. By exploiting analogies to the case of … Read more

## Convex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Programs: Projected Formulations

A common way to produce a convex relaxation of a Mixed Integer Quadratically Constrained Program (MIQCP) is to lift the problem into a higher dimensional space by introducing variables \$Y_{ij}\$ to represent each of the products \$x_i x_j\$ of variables appearing in a quadratic form. One advantage of such extended relaxations is that they can … Read more

## Convex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Programs: Extended Formulations

This paper addresses the problem of generating strong convex relaxations of Mixed Integer Quadratically Constrained Programming (MIQCP) problems. MIQCP problems are very difficult because they combine two kinds of non-convexities: integer variables and non-convex quadratic constraints. To produce strong relaxations of MIQCP problems, we use techniques from disjunctive programming and the lift-and-project methodology. In particular, … Read more

## On the Relative Strength of Split, Triangle and Quadrilateral Cuts

Integer programs defined by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilateral inequalities. In this paper, we compare the strength of these three families of inequalities. In particular we study how well each family approximates the integer hull. We show that, in … Read more

## Disjunctive Cuts for Non-Convex Mixed Integer Quadratically Constrained Programs

This paper addresses the problem of generating strong convex relaxations of Mixed Integer Quadratically Constrained Programming (MIQCP) problems. MIQCP problems are very difficult because they combine two kinds of non-convexities: integer variables and non-convex quadratic constraints. To produce strong relaxations of MIQCP problems, we use techniques from disjunctive programming and the lift-and-project methodology. In particular, … Read more

## An Exact Solution Approach for Portfolio Optimization Problems under Stochastic and Integer Constraints

In this paper, we study extensions of the classical Markowitz mean-variance portfolio optimization model. First, we consider that the expected asset returns are stochastic by introducing a probabilistic constraint which imposes that the expected return of the constructed portfolio must exceed a prescribed return threshold with a high confidence level. We study the deterministic equivalents … Read more

## A Feasibility Pump for Mixed Integer Nonlinear Programs

We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the algorithm can be iterated so as to improve the first solution it finds, as well as its integration within … Read more

## An algorithmic framework for convex mixed integer nonlinear programs

This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer linear programming and nonlinear programming, have seen considerable and steady progress in recent … Read more