Re: [Help-glpk] linear ordering problem again

[Yingjie Lan]

> > 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.
>

Well, if you think about easy of use, while obtain 
the same effects: in one case you need to write some
code that requires a lot more information, 
in another case you just need to give the objective 
value.

> > 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

Thanks for the suggestion. 
The same comments above applies here as well.