Thanks again,
If anyone is interested.
My solution with a lot of help from Andrew Makhorin:
Problem: Compare two matrices, one including variables, the other including
parameters, both binary. Make sure that at most n changes can be made
between the two matrices.
Background: I use this for a sc
> I am trying to implement your information, however there is one
> small other problem. In the data section, how should I write down
> the values for the A[a,b,c] matrix?
Please see model train.mod in the subdirectory 'examples'.
___
Help-glpk mailin
Thanks a lot for your answer.
I am trying to implement your information, however there is one small other
problem. In the data section, how should I write down the values for the
A[a,b,c] matrix?
For two dimensional, I always use:
param A : a1 a2 :=
b1 1 1
b2 1 1;
However, for thr
Note than on processing the reason GLP_IBINGO you can obtain components
of the current mip solution (using glp_ios_get_prob, glp_mip_status,
glp_mip_obj_val, and glp_mip_obj_val) and then continue the search
rather then terminate it.
___
Help-glpk mail
>>> I would like to know if there a possibility to make GLPK stop as
>>> soon as a feasible solution is found.
>>
>> It is possible only on api level.
> I was indeed looking for a solution on API level.
> Do you mean I nedd to use the new callback mechanism ?
Yes, I do.
> I thought there
> wo
Andrew Makhorin a écrit :
I would like to know if there a possibility to make GLPK stop as
soon as a feasible solution is found.
It is possible only on api level.
I was indeed looking for a solution on API level.
Do you mean I nedd to use the new callback mechanism ? I thought there
would
