An approximate algorithm for nonlinear integer programming

This paper suggests an approximate algorithm, designed to solve nonlinear integer problems. This algorithm belongs to the class of component algorithms of feasible integer directions. The search for a feasible integer direction is done on the basis of a linear approximation of the objective function and the constraints at the integer points under consideration. Theoretical analysis is presented, as well as experimental investigation, using the algorithm for test examples taken from the literature.