A filled function method for finding a global minimizer on global integer optimization (Q557731): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: You-lin Shang / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Lian-Sheng Zhang / rank | |||
Normal rank | |||
Revision as of 11:21, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A filled function method for finding a global minimizer on global integer optimization |
scientific article |
Statements
A filled function method for finding a global minimizer on global integer optimization (English)
0 references
30 June 2005
0 references
The authors present an algorithm for solving a nonlinear integer programming problem. This algorithm is based on a filled function introduced by the authors in this paper, obtained by modifying the global convexized filled function for continuous global optimization. Some numerical experiments and conclusions are given.
0 references
integer programming
0 references
local minimizer
0 references
global minimizer
0 references
filled function
0 references
global optimization
0 references
nonlinear integer programming
0 references
numerical experiments
0 references
