@Article{JCM-22-1,
author = {Weiwen, Tian and Zhang, Liansheng},
title = {An Algorithm for Finding Global Minimum of Nonlinear Integer Programming},
journal = {Journal of Computational Mathematics},
year = {2004},
volume = {22},
number = {1},
pages = {69--78},
abstract = {<p style="text-align: justify;">A filled function is proposed by R.Ge[2] for finding a global minimizer of a function of several continuous variables. In [4], an approach for finding a global integer minimizer of nonlinear function using the above filled function is given. Meanwhile a major obstacle is met: if $ρ &gt; 0$ is small, and $||x_I-\overset{*}{x}_I||$ is large, where $x_I$ - an integer point, $\overset{*}{x}_I$ - a current local integer minimizer, then the value of the filled function almost equals zero. Thus it is difficult to recognize the size of the value of the filled function and can not find the global integer minimizer of nonlinear function. In this paper, two new filled functions are proposed for finding global integer minimizer of nonlinear function, and the new filled function improves some properties of the filled function proposed by R. Ge [2].<br/>Some numerical results are given, which indicate the new filled function (4.1) to find global integer minimizer of nonlinear function is efficient.</p>},
issn = {1991-7139},
doi = {https://doi.org/2004-JCM-10335},
url = {https://global-sci.com/article/85190/an-algorithm-for-finding-global-minimum-of-nonlinear-integer-programming}
}