> Thanks, I noticed that one, but what if I only know an objective > value, not the actual solution?
If you cannot demonstrate the solution, you cannot assert that the objective value you know is valid. > In fact, it seems the solution is not > of much help for pruning, but just the objective value. In any case you can add an inequality constraint that limits the objective to a specified value, e.g. for minimization: c1 x1 + ... + cn xn <= obj value _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
