Extended Formulations via Decision Diagrams

by   Yuta Kurokawa, et al.

We propose a general algorithm of constructing an extended formulation for any given set of linear constraints with integer coefficients. Our algorithm consists of two phases: first construct a decision diagram (V,E) that somehow represents a given m × n constraint matrix, and then build an equivalent set of |E| linear constraints over n+|V| variables. That is, the size of the resultant extended formulation depends not explicitly on the number m of the original constraints, but on its decision diagram representation. Therefore, we may significantly reduce the computation time for optimization problems with integer constraint matrices by solving them under the extended formulations, especially when we obtain concise decision diagram representations for the matrices. We can apply our method to 1-norm regularized hard margin optimization over the binary instance space {0,1}^n, which can be formulated as a linear programming problem with m constraints with {-1,0,1}-valued coefficients over n variables, where m is the size of the given sample. Furthermore, introducing slack variables over the edges of the decision diagram, we establish a variant formulation of soft margin optimization. We demonstrate the effectiveness of our extended formulations for integer programming and the 1-norm regularized soft margin optimization tasks over synthetic and real datasets.


page 14

page 16


Binary extended formulations and sequential convexification

A binarization of a bounded variable x is a linear formulation with vari...

Integer Linear Programming Formulations for Double Roman Domination Problem

For a graph G= (V,E), a double Roman dominating function (DRDF) is a fun...

On the convex hull of convex quadratic optimization problems with indicators

We consider the convex quadratic optimization problem with indicator var...

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack

Standard mixed-integer programming formulations for the stable set probl...

Constrained Optimization of Rank-One Functions with Indicator Variables

Optimization problems involving minimization of a rank-one convex functi...

Extended formulations from communication protocols in output-efficient time

Deterministic protocols are well-known tools to obtain extended formulat...

A Surrogate Objective Framework for Prediction+Optimization with Soft Constraints

Prediction+optimization is a common real-world paradigm where we have to...

Please sign up or login with your details

Forgot password? Click here to reset