3 papers
math.OC2019
A study of rank-one sets with linear side constraints and application to the pooling problem
Santanu S. Dey, Burak Kocuk, Asteroide Santana
We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints,…
math.OC2018
The convex hull of a quadratic constraint over a polytope
Asteroide Santana, Santanu S. Dey
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadra…
math.OC2018
New SOCP relaxation and branching rule for bipartite bilinear programs
Santanu S. Dey, Asteroide Santana, Yang Wang
A bipartite bilinear program (BBP) is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables…