Originally posted by: RafaelMartinelli
Hello,
I have a MIQCP formulation, with only binary variables. Everything is linear, but one set of constraints like:
ΣiΣj xixj ≥ constant
These constraints are not convex. When running cplex, it seems the solver used is a Branch-and-Bound. I would like to know how does cplex deal with these constraints. Does it linearize them? Or does it try to convexify them? I need to know to argue about comparing with other methods.
Thank you,
Rafael
#CPLEXOptimizers#DecisionOptimization