On Mon, 11 Apr 2011, Klas Markström wrote:
I think that Jeff had approximately the right idea.
In the callback to check possible integer feasible solutions
test whether it is actaully fesible.
If so, add it to your list, add a constraint and declare it infeasible.
If not, proceeed as usual.
At the end, GLPK will return infeasible and
I think that the list will contain at least
the extreme points of the convex hull.
--
Michael [email protected]
"Pessimist: The glass is half empty.
Optimist: The glass is half full.
Engineer: The glass is twice as big as it needs to be."
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
