Re: [Help-glpk] finding integer solutions gives seemingly infinite loop

[Michael Hennebry]

On Tue, 3 Apr 2012, John Perry wrote:

> > From a previous conversation, I understand that setting upper bounds for 
> > integer solutions helps the mip preprocessor find feasible solutions for 
> > minimization problems that have no maximum. I can make this work with the 
> > systems I'm solving right now, but I'm not sure how to set a good upper bound 
> > in general.
>
> Is there a good rule of thumb for this?

Is the corresponding max problem really unbounded?
In real-world problems and a lot of others,
the variables have both upper and lower bounds.

--
Michael   address@hidden
"On Monday, I'm gonna have to tell my kindergarten class,
whom I teach not to run with scissors,
that my fiance ran me through with a broadsword."  --  Lily