Volume 17, Issue 2
Nonlinear Integer Programming and Global Optimization

Lian Sheng Zhang, Feng Gao & Wen Xing Zhu

DOI:

J. Comp. Math., 17 (1999), pp. 179-190

Published online: 1999-04

Preview Full PDF 106 1657
Export citation

Cited by

google scholar semantic scholar
  • Abstract

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-Bpund algorithm. Numerical experiments show that this approach is efficient.

  • Keywords

Integer programming Global minimization problem Branch-boundalgorithm

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-17-179, author = {}, title = {Nonlinear Integer Programming and Global Optimization}, journal = {Journal of Computational Mathematics}, year = {1999}, volume = {17}, number = {2}, pages = {179--190}, abstract = { 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-Bpund algorithm. Numerical experiments show that this approach is efficient. }, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9092.html} }
TY - JOUR T1 - Nonlinear Integer Programming and Global Optimization JO - Journal of Computational Mathematics VL - 2 SP - 179 EP - 190 PY - 1999 DA - 1999/04 SN - 17 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9092.html KW - Integer programming KW - Global minimization problem KW - Branch-boundalgorithm AB - 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-Bpund algorithm. Numerical experiments show that this approach is efficient.
Lian Sheng Zhang, Feng Gao & Wen Xing Zhu. (1970). Nonlinear Integer Programming and Global Optimization. Journal of Computational Mathematics. 17 (2). 179-190. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard