Work

A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints

Year: 2022

Type: article

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.

Source: Mathematics

DOI: 10.3390/math10050734

Authors: Suxia Ma, Yuelin Gao, Bo Zhang, Wenlu Zuo

Institutions: North Minzu University, Ningxia University

Language: English

Topic: Advanced Optimization Algorithms Research

Subfield: Numerical Analysis

Field: Mathematics

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,885

Funder: National Natural Science Foundation of China