[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] Phase I
From: |
Ali Baharev |
Subject: |
Re: [Help-glpk] Phase I |
Date: |
Wed, 13 Feb 2008 00:59:24 +0100 |
Hi,
Why don't you call glp_simplex with zero (or constant) objective?
Good luck!
Ali
On Feb 13, 2008 12:50 AM, Dragos Ilie <address@hidden> wrote:
> Hi!
>
> 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.
>
> Regards,
> Dragos
>
>
> _______________________________________________
> Help-glpk mailing list
> address@hidden
> http://lists.gnu.org/mailman/listinfo/help-glpk
>