This paper proposes an algorithm to solve differentiable integer progr
amming problems. After linear approximation of the objective function
and the constraints, a genetic algorithm is designed to provide an ini
tial solution and to search for a feasible direction at the integer po
ints so that a better integral. point can be found. Theoretical analys
is and experimental investigation are presented. The result shows that
the proposed method guarantees a local optimum and for 12 test proble
ms, the global optima are all obtained. (C) 1998 Elsevier Science Ltd.
All rights reserved.