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

[John Perry]

Hi

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

Alternately, can anyone suggest reading material that might lead me in the 
right direction?

thanks & regards
john perry