On Sun, 8 Jan 2006 [EMAIL PROTECTED] wrote: > btw, my problem involves up to 56 binary vars where > the constraints have real-valued coefficients and > limits, and the objective fn minimizes the sum of the > vars. Problems in this format are solved much faster > than I expected for a binary problem: in under 100msec > on a 1GHz cpu. I'd like to document what algorithm is > responsible for this speedy result.
Probably it was an easy problem. The number of possible objective values is at most 57. That can be important if the solver notices that the objective value must be an integer. -- Mike [EMAIL PROTECTED] May you live in interesting times. -- Drasnian blessing _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
