[Haskell-cafe] Finding points contained within a convex hull.

Jan-Willem Maessen jmaessen at alum.mit.edu
Thu Jun 7 10:04:32 EDT 2007

On Jun 6, 2007, at 11:38 PM, Daniel McAllansmith wrote:
[Trying to find the domain of a bounded integer linear program]
> How would you go about finding extreme vertices?  Would it be  
> quicker than
> solving the constraints for each max/min?

If you're just looking to find bounding coordinates in each  
dimension, you should be able to do this using linear programming.   
This will yield non-integer coordinate bounds which you can narrow as  

-Jan-Willem Maessen

-------------- next part --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 2425 bytes
Desc: not available
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20070607/9886d468/smime.bin

More information about the Haskell-Cafe mailing list