Year: 1999
Author: Lian-Sheng Zhang, Feng Gao, Wen-Xing Zhu
Journal of Computational Mathematics, Vol. 17 (1999), Iss. 2 : pp. 179–190
Abstract
Various approaches have been developed for solving a variety of continuous global optimization problems. But up to now, less work has been devoted to solving nonlinear integer programming problems due to the inherent difficulty. This paper manages to transform the general nonlinear integer programming problem into an "equivalent" special continuous global minimization problem. Thus any effective global optimization algorithm can be used to solve nonlinear integer programming problems. This result will also promote the research on global optimization. We present an interval Branch-and-Bound algorithm. Numerical experiments show that this approach is efficient.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1999-JCM-9092
Journal of Computational Mathematics, Vol. 17 (1999), Iss. 2 : pp. 179–190
Published online: 1999-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 12
Keywords: Integer programming Global minimization problem Branch-bound algorithm.