Result: A new filled function method for nonlinear integer programming problem
Title:
A new filled function method for nonlinear integer programming problem
Source:
Applied mathematics and computation. 173(2):938-950
Publisher Information:
New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 21 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse mathématique, Mathematical analysis, Calcul des variations et contrôle optimal, Calculus of variations and optimal control, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Méthodes numériques en programmation mathématique, optimisation et calcul variationnel, Numerical methods in mathematical programming, optimization and calculus of variations, Programmation mathématique numérique, Numerical methods in mathematical programming, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Programmation en nombres entiers, Integer programming, Programación entera, Programmation non linéaire, Non linear programming, Programación no lineal, Fonction remplie, Filled function, Minimiseur discret global, Discrete global minimizer, Filled function method
Document Type:
Academic journal
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Applied Mathematics, Shenzhen University, Shenzhen 518060, China
Department of Mathematics, Chongqing Normal University, Chongqing 400047, China
Department of Mathematics, Chongqing Normal University, Chongqing 400047, China
ISSN:
0096-3003
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.17570068
Database:
PASCAL Archive
Further Information
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.