An Algorithm for Solving the Global Optimization of Nonlinear Integer Programming

Zhang Zhi-hong · Journal of Shijiazhuang University · 2006

This paper presents an algorithm to solve nonlinear integer programming problems.After finding out a discrete local minimal solution by using a genetic algorithm as a initial point,the algorithm tries to improve a discrete local minimal solution by minimizing a filled function.Finally,a global solution will be found after finite iterations.Numerical experiments show that this algorithm is efficient.

Read the paper · More papers on PaperTik