A new discrete filled function algorithm for discrete global optimization

A definition of the discrete filled function is given in this paper. Based on the definition, a discrete filled function is proposed. Theoretical properties of the proposed discrete filled function are investigated, and an algorithm for discrete global optimization is developed from the new discrete...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computational and applied mathematics Vol. 202; no. 2; pp. 280 - 291
Main Authors:	Yongjian, Yang, Yumei, Liang
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.05.2007 Elsevier
Subjects:	Calculus of variations and optimal control Discrete global optimization Exact sciences and technology Filled function method Mathematical analysis Mathematics Nonlinear integer programming Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Sciences and techniques of general use Discrete global optimization Nonlinear integer programming Filled function method Discrete function Integer programming Numerical analysis Applied mathematics Non linear programming Mathematical programming
ISSN:	0377-0427, 1879-1778
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	A definition of the discrete filled function is given in this paper. Based on the definition, a discrete filled function is proposed. Theoretical properties of the proposed discrete filled function are investigated, and an algorithm for discrete global optimization is developed from the new discrete filled function. The implementation of the algorithms on several test problems is reported with satisfactory numerical results.
ISSN:	0377-0427 1879-1778
DOI:	10.1016/j.cam.2006.02.032