Hi
I would like to generate a dual ray when the first phase of the primal simplex
algorithm cannot reach the zero objective value. The auxiliary optimization
problem's dual solution is exactly an infeasible ray (dual unbounded ray), but
I do not know, how can I retrieve it in glpk. Could you
And what about, when the problem is primal-dual infeasible. Then there is a
primal ray and also a dual ray, however there is not feasible solution for
both problems. I have a function, which computes the ray, if glpk finds out
the problem is unbounded in the second phase, but I looking for a
Hi
The glp_adv_basis() prints Crashing..., even if the the LPX_K_MSGLEVEL is
set to zero. Is this function safe, what does the message means?
Best, Balazs
___
Help-glpk mailing list
Help-glpk@gnu.org
