|
|
|
|
| LEADER |
01306nam a2200205Ia 4500 |
| 001 |
10.3390-math10050734 |
| 008 |
220425s2022 CNT 000 0 und d |
| 020 |
|
|
|a 22277390 (ISSN)
|
| 245 |
1 |
0 |
|a A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints
|
| 260 |
|
0 |
|b MDPI
|c 2022
|
| 856 |
|
|
|z View Fulltext in Publisher
|u https://doi.org/10.3390/math10050734
|
| 520 |
3 |
|
|a 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. © 2022 by the authors. Licensee MDPI, Basel, Switzerland.
|
| 650 |
0 |
4 |
|a constrained integer program
|
| 650 |
0 |
4 |
|a discrete global optimization
|
| 650 |
0 |
4 |
|a nonparametric filled function method
|
| 700 |
1 |
|
|a Gao, Y.
|e author
|
| 700 |
1 |
|
|a Ma, S.
|e author
|
| 700 |
1 |
|
|a Zhang, B.
|e author
|
| 700 |
1 |
|
|a Zuo, W.
|e author
|
| 773 |
|
|
|t Mathematics
|
