DeepAI AI Chat
Log In Sign Up

Piecewise Polyhedral Formulations for a Multilinear Term

by   Kaarthik Sundar, et al.

In this paper, we present a mixed-integer linear programming formulation of a piecewise, polyhedral relaxation (PPR) of a multilinear term using it's convex hull representation. Based on the solution of the PPR, we also present a MIP-based piecewise formulation which restricts the solutions to be feasible for the multilinear term. We then present computational results showing the effectiveness of proposed formulations on instances from the standard Mixed-Integer Nonlinear Programming Library (MINLPLib) and compare the proposed formulation with a formulation that is built by recursively relaxing bilinear groupings of the multilinear term, typically applied in the literature.


page 1

page 2

page 3

page 4


Convex Hull Formulations for Mixed-Integer Multilinear Functions

In this paper, we present convex hull formulations for a mixed-integer, ...

A Tight Formulation for the Dial-a-Ride Problem

Ridepooling services play an increasingly important role in modern trans...

Optimal binning: mathematical programming formulation

The optimal binning is the optimal discretization of a variable into bin...

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks

The COVID-19 pandemic has been a recent example for the spread of a harm...

Long term planning of military aircraft flight and maintenance operations

We present the Flight and Maintenance Planning (FMP) problem in its mili...

Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model

This paper concerns a method of selecting a subset of features for a seq...