[Scip] Using SCIP included in another source code to solve quadratic constraints

[Jiehua Chen]

Dear all,

I have a quadratic constraint problem which I try to solve by using SCIP 
(as a library) in C++. However, my program does not terminate after 1 
hour. Curiously, if I use your online solver

  http://www.neos-server.org/neos/solvers/go:scip/CPLEX.html

, then after several seconds I got the solution. Can you please help me? 
Thanks!

Below is the problem:

-------------------------------------------------------------------
minimize y#1


subject to
a#1 = 0
a#2 = 0

[a#1^2 + a#2^2 - 2 a#1*v#11 - 2 a#2*v#12 - b#1^2 - b#2^2 + 2 b#1*v#11 + 
2 b#2*v#12] + y#1 <= 0
[b#1^2 + b#2^2 - 2 b#1*v#11 - 2 b#2*v#12 - c#1^2 - c#2^2 + 2 c#1*v#11 + 
2 c#2*v#12] + y#1 <= 0
[c#1^2 + c#2^2 - 2 c#1*v#11 - 2 c#2*v#12 - d#1^2 - d#2^2 + 2 d#1*v#11 + 
2 d#2*v#12] + y#1 <= 0

[b#1^2 + b#2^2 - 2 b#1*v#21 - 2 b#2*v#22 - c#1^2 - c#2^2 + 2 c#1*v#21 + 
2 c#2*v#22] + y#1 <= 0
[c#1^2 + c#2^2 - 2 c#1*v#21 - 2 c#2*v#22 - d#1^2 - d#2^2 + 2 d#1*v#21 + 
2 d#2*v#22] + y#1 <= 0
[d#1^2 + d#2^2 - 2 d#1*v#21 - 2 d#2*v#22 - a#1^2 - a#2^2 + 2 a#1*v#21 + 
2 a#2*v#22] + y#1 <= 0

[c#1^2 + c#2^2 - 2 c#1*v#31 - 2 c#2*v#32 - d#1^2 - d#2^2 + 2 d#1*v#31 + 
2 d#2*v#32] + y#1 <= 0
[d#1^2 + d#2^2 - 2 d#1*v#31 - 2 d#2*v#32 - a#1^2 - a#2^2 + 2 a#1*v#31 + 
2 a#2*v#32] + y#1 <= 0
[a#1^2 + a#2^2 - 2 a#1*v#31 - 2 a#2*v#32 - b#1^2 - b#2^2 + 2 b#1*v#31 + 
2 b#2*v#32] + y#1 <= 0

y#1 >= 0.01

end
-------------------------------------------------------------------


Best regards!
Jiehua Chen