Journal of the
Korean Mathematical Society
JKMS

ISSN(Print) 0304-9914 ISSN(Online) 2234-3008

Article

HOME ALL ARTICLES View

J. Korean Math. Soc. 2011; 48(5): 985-999

Printed September 1, 2011

https://doi.org/10.4134/JKMS.2011.48.5.985

Copyright © The Korean Mathematical Society.

A filled function method for box constrained nonlinear integer programming

Youjiang Lin and Yongjian Yang

Shanghai University, Shanghai University

Abstract

A new filled function method is presented in this paper to solve box-constrained nonlinear integer programming problems. It is shown that for a given non-global local minimizer, a better local minimizer can be obtained by local search starting from an improved initial point which is obtained by locally solving a box-constrained integer programming problem. Several illustrative numerical examples are reported to show the efficiency of the present method.

Keywords: global optimization, filled function method, nonlinear integer programming, local minimizer, global minimizer

MSC numbers: 52A10, 52A40

Stats or Metrics

Share this article on :

Related articles in JKMS

more +