An approximate algorithm for nonlinear integer programming

摘要

This paper presents an approximate algorithm, which is modified from the Filled Function method for continuous global optimization, to solve nonlinear integer programming problems. Unlike the other approximate methods, the algorithm tries to improve a discrete local minimal solution by minimizing a filled function. It is a direct method. Numerical experiments show that this algorithm is efficient.