Re: [Help-glpk] [Fwd: GPLK and consistency of global constraints]

[Raniere Silva]

Hi Umar,

> I would like to know about the techniques GPLK (or any other solver)
> uses to ensure global consistency of all constraints while making a
> choice. For example, for a MIP(mixed integer) program with binary
> variables x_1...x_n a solver needs to decide whether a variable x_i will
> be 0 or 1. How does a solver compute whether making a choice x_i = 0 is
> not inconsistent/consistent with  the constraints or already made
> decisions in the model?

GPLK use the branch-and-bound method with simplex solver and because of that we
didn't have to worry about inconsistent.

If you use some heuristic method you will have to deal with the problem but in
this case you probably have to create your own method to solve the consistent.

Raniere