[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Help-glpk] Phase I

From: Dragos Ilie
Subject: [Help-glpk] Phase I
Date: Wed, 13 Feb 2008 00:50:34 +0100
User-agent: Thunderbird (X11/20071116)


I am interested in using glpk to find a (initial) feasible solution to a problem with linear constraints. This should be equivalent the result of Phase I in the simplex algorithm. According to the Changelog, there used to be a lpx_prim_feas() function in glpk-4.1 that was doing that.

I would like to know if that function still exists, or if there is now a different way to obtain a feasible solution. I noticed a spx_prim_feas() function in the source code but I am not sure if that is what I should use.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]