Dear Jeanette,
Consider using library functions glp_get_unbnd_ray() and
glp_get_row_stat() to determine *one* of the rows leading to
infeasibility. See file doc/glpk.pdf of the GPLK source.
Best regards
Heinrich
On 1/5/21 2:44 AM, Mate Hegyhati wrote:
Hi!
Maybe I'm wrong, but I don't think
Hi!
Maybe I'm wrong, but I don't think that such an indicator is
programmable. Consider this small example with 3 non-negative variables:
x + y <= 1
x + z <= 1
y + z <= 1
x + y + z >= 2
Remove any of the constraints, and it becomes feasible. You wouldn't be
able to tell, which one is wrong
Forwarded Message
Date: Mon, 4 Jan 2021 23:23:17 +
Subject: Question for infeasible LP problem
To: help-glpk@gnu.org
From: "Du, Jeanette"
>
>
>
>
>
>
>
>
> Hello,
>
> I am relatively new to GLPK LP solver. Is there a way to find out the
> constraint(s) that cause
