A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints
Open Access
- 25 February 2022
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 10 (5) , 734
Abstract
In this paper, we investigate and develop a new filled function method for solving integer programming problems with constraints. By adopting the appropriate equivalent transformation method, these problems are transformed into a class of box-constrained integer programming problems. Then, an effective nonparametric filled function is constructed, and a new global optimization algorithm is designed using the discrete steepest descent method. Numerical experiments illustrate that this algorithm has effectiveness, feasibility, and better global optimization ability.Keywords
Funding Information
- National Natural Science Foundation of China (11961001)
- Construction Project of first-class subjects in Ningxia higher Education (NXYLXK2017B09)
- Major proprietary funded project of North Minzu University (ZDZX201901)
This publication has 26 references indexed in Scilit:
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problemsApplied Mathematics and Computation, 2010
- Finding discrete global minima with a filled function for integer programmingEuropean Journal of Operational Research, 2008
- A filled function method for constrained nonlinear integer programmingJournal of Industrial and Management Optimization, 2008
- A new filled function method for nonlinear integer programming problemApplied Mathematics and Computation, 2005
- Discrete Filled Function Method for Discrete Global OptimizationComputational Optimization and Applications, 2005
- An improved simulated annealing simulation optimization method for discrete parameter stochastic systemsComputers & Operations Research, 2005
- An approximate algorithm for nonlinear integer programmingApplied Mathematics and Computation, 1998
- General local search methodsEuropean Journal of Operational Research, 1996
- A branch and bound algorithm for solving separable convex integer programming problemsComputers & Operations Research, 1994
- A continuous approach to nonlinear integer programmingApplied Mathematics and Computation, 1989