A new filled function method for nonlinear integer programming problem

Yanhong Gu

doi:10.1016/j.amc.2005.04.025

Return

A new filled function method for nonlinear integer programming problem

2006-02-01

PRE

Yanhong Gu

吴

吴至友 (Zhiyou Wu)

DOI：10.1016/j.amc.2005.04.025

Original

Original request for help

Save

Abstract

En 中文

In this paper, we develop a new filled function method to solve nonlinear integer programming problem. It is shown that any local minimizer of the new filled function constructed from a current local minimizer is either a better local minimizer of the original integer programming problem or a vertex of its constrained domain. Hence a better local minimizer can be obtained just by local search scheme for the new filled function. An algorithm based on the nice properties of the new filled function is proposed for locating the global minimizer of the original integer programming problem. Several numerical examples are presented to show the efficiency of the algorithm. (c) 2005 Elsevier Inc. All rights reserved.

Keywords:

integer programming

filled function method

discrete global minimizer