Abstract
In this paper, we investigate and develop a new filled function method for solving integer programming problems with constraints. By adopting the appropriate equivalent transformation method, these problems are transformed into a class of box-constrained integer programming problems. Then, an effective nonparametric filled function is constructed, and a new global optimization algorithm is designed using the discrete steepest descent method. Numerical experiments illustrate that this algorithm has effectiveness, feasibility, and better global optimization ability.
Funding Information
  • National Natural Science Foundation of China (11961001)
  • Construction Project of first-class subjects in Ningxia higher Education (NXYLXK2017B09)
  • Major proprietary funded project of North Minzu University (ZDZX201901)

This publication has 26 references indexed in Scilit: