I modeled a MISCOP problem with the following second-order cone constraints and this problem can be solved by CPLEX successfully. But, the weird thing is that when I fixed all integer variables as the values obtained, the CPLEX failed to solve the SCOP problem and said that these cone constraints are not convex. However, when I use the cplexd solver, it works. Why did this happen?

Hi,
Michael,
many thanks for your answer. But, in the MISOCP problem, why did the Cplex can recognize the cone constraints and solve the problem successfully?

Hard to say. But with binary variables Cplex can do more preprocessing and might be able to identify convexity where it can’t do that with continuous variable only. Lot’s of speculation without seeing the entire model.

Hi
I have the same problem. I 'm using benders to solve a second order conic problem . original problem is MIQCP and is solved using gams/ cplex. when I fix the binary variables in dual subproblem (QCP) in “large size”, it is unbounded even using cplexd.I tried to solve the primal problem utilizing obj function of dual subproblem in optimality cut, but it is not convereged.I’d appreciate if you could guide me through this.