[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] doubts
From: |
Andrew Makhorin |
Subject: |
Re: [Help-glpk] doubts |
Date: |
Sat, 5 May 2007 15:15:26 +0400 |
> how get all feasible basic solutions encountered by lpx_simplex,
> during its optimal solution searching?
You can limit the maximal number of iterations to 1 before each call
to lpx_simplex, i.e.
loop: lpx_set_int_parm(lp, LPX_K_ITLIM, 1);
ret = lpx_simplex(lp);
. . .
goto loop;
In this case lpx_simplex will perform one iteration and then return.
Current basic solution components can be obtained in a usual way.
Note that the lp presolver must be disabled.
For more details see the reference manual.
> Is there any similar in glpk 4.8 java interface?
Probably, yes.
Andrew Makhorin
- [Help-glpk] doubts, Ricardo Martins, 2007/05/04
- Re: [Help-glpk] doubts,
Andrew Makhorin <=