Generalized linear programming problems have been well solved by column generation and dual ascent procedures. The same problems with the variables restricted to be integer have only been solved when all the coefficients are known explicitly. This paper finds lower bounds for the optimal value of such programs requiring only the implicit definition of the activities
