On 06/08/2010 07:50 PM, Volker Braun wrote: > Can PPL find integral points in polyhedra with not necessarily > integral vertices (mixed integer programming)? I'm somewhat familiar > with the library but I don't see how to do that. Code sample?
To be honest, I've only used it to compute linear descriptions of convex hulls of binary points. Scanning through the documentation, I can't find any enumeration method either. Only tests for (integer) set elements in the Polyhedron class, and the MIP class can also produce _a_ feasible point. The Grid abstraction PPL provides doesn't seem to help either, sorry for the false advertising. -- Robert Schwarz -- rschwarz.net -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
