[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] Simplex vertex neighborhood
From: |
Andrew Makhorin |
Subject: |
Re: [Help-glpk] Simplex vertex neighborhood |
Date: |
Sat, 17 Aug 2013 10:24:17 +0400 |
> Is it possible to enumerate the neighboring feasible solutions of the
> solution of an lp?
> I assume that in order to decide if the simplex algorithm can stop it
> is necessary to check all neighboring feasible solutions. Is this right?
> And if so is there a way of enumerating the neighborhood of feasible
> solutions around the optimal one?
>
You may perform the post-optimal analysis by specifying the '--ranges'
option for glpsol, or with the routine glp_print_ranges. For more
details please see the glpk reference manual, Section 3.4 "Post-optimal
analysis routines".
- Re: [Help-glpk] Simplex vertex neighborhood, (continued)
- Re: [Help-glpk] Simplex vertex neighborhood, Kevin Hunter Kesling, 2013/08/16
- Re: [Help-glpk] Simplex vertex neighborhood, Michael Hennebry, 2013/08/17
- Re: [Help-glpk] Simplex vertex neighborhood, sgerber, 2013/08/19
- Re: [Help-glpk] Simplex vertex neighborhood, Michael Hennebry, 2013/08/19
- Re: [Help-glpk] Simplex vertex neighborhood, Matteo Fischetti DEI, 2013/08/19
- Re: [Help-glpk] Simplex vertex neighborhood, Michael Hennebry, 2013/08/20
Re: [Help-glpk] Simplex vertex neighborhood,
Andrew Makhorin <=