A note on representations of linear inequalities in non-convex mixed-integer quadratic programs

摘要

AbstractIn the literature on the quadratic 0–1 knapsack problem, several alternative ways have been given to represent the knapsack constraint in the quadratic space. We extend this work by constructing analogous representations for arbitrary linear inequalities for arbitrary non-convex mixed-integer quadratic programs with bounded variables.]]>