7 Jun
2007
7 Jun
'07
10:04 a.m.
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 appropriate. -Jan-Willem Maessen