Thanks for your reply. Please see
my reply in the lines.
I've tested your model. In fact, it is not hard for glpk 4.37 and can
be solved in several minutes. However, it is hard enough to be solved
faster.
The model looks like a pseudo-boolean problem (more precisely, like
a satisfiability
Here is the cplex lp file and the mps file.
Thanks.
Wrong results appear, because the problem is badly scaled. This is
caused by two tiny constraint coefficients:
C036 R033 -5.16198E-27 R034 -0.079105507
C036 R039 -0.092756701 R040 -5.51167E-27
To
Hello,
I am currently using GLPK with the Java interface developped and made
available in the following website: http://bjoern.dapnet.de/glpk/
When I solve a LP and I want to retrieve the values of the solution (using
getColPrim() and getColDual(), for example), these values (they are of type