On Mon, 9 Jun 2008, Lou Hafer wrote: > This question (`How can I enumerate all vertices using the <foo> linear > program solver?') comes up a fair bit on the various lists I follow. I > thought
"Tell me what you need, and I'll tell you how to get along without it." -- Dilbert. Not being as good as Dilbert, I'd have to know why you need it. Note that even in a fairly small number of dimensions, it's possible for the answer to overflow a large disk drive. An n-cube has 2**n vertices though its defined with only 2n constraints. > I'd point out that this is something the computational geometry folks work on, > and they don't complicate the issue by insisting on an objective function. > > Here are some pointers: > > lrs: http://cgm.cs.mcgill.ca/~avis/C/lrslib/lrslib.html > > cdd: http://www.ifor.math.ethz.ch/~fukuda/cdd_home/ > > pd: http://www.cs.unb.ca/~bremner/software/pd/ > > Other than existence, I don't know much of anything about these packages, and > there may well be more recent packages available. Questions should go to a > list > populated by computational geometry people (who must be out there somewhere > :-). -- Michael [EMAIL PROTECTED] "Those parts of the system that you can hit with a hammer (not advised) are called Hardware; those program instructions that you can only curse at are called Software." _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
