Open mtanneau opened 4 years ago
I have modified Clp/master so that it recognizes that barrier will use too much memory and switch to simplex. Looking at the flop count, barrier would have taken several years! If I run clp with -dualize 0 -barrier then it switches to dual and takes an hour but does solve (just running clp takes a minute).
The dualize option is not available in the C interface.
I am trying to solve some of the H Mittelmann benchmark instances with Clp's interior-point algorithm. The following occurs when trying to solve
neos3
.Running Clp's command line executable works fine
and I obtain a log similar to this one.
However, when calling Clp through its C interface (see code below), I get a segmentation fault.
The big question is: why segfault when using the C interface and not when using the executable?
FWIW, the executable correctly detects that it should solve the dual problem, and things run smoothly. When using the C interface, Clp just dies out (see the log below).
Here is the code I am running
The output is
Version info:
coinbrew
gcc 7.5.0
and linked againstlibClp.so
Note: I originally ran into this issue while using Clp via Julia; see https://github.com/JuliaOpt/Clp.jl/issues/81. The sequence of C calls to Clp is exactly the one I reproduced above.