[Top][All Lists]

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

[Help-glpk] Simplex vertex neighborhood

From: sgerber
Subject: [Help-glpk] Simplex vertex neighborhood
Date: Thu, 15 Aug 2013 14:57:15 -0400
User-agent: Roundcube Webmail/0.8.2


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?

Thanks and kind regards

reply via email to

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