A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (Q1110993)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems |
scientific article |
Statements
A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems (English)
0 references
1988
0 references
The author examines a nonlinear function minimization problem in Euclidean space in the presence of constraints and connection of its solution with the solution of an integer programming problem. An optimality condition in alternative form is obtained in terms of Lagrange. The number of branch and bound nodes checked in the method is small. Results of numerical experiments confirm the efficiency.
0 references
branch and bound algorithm
0 references
real imbedding
0 references
dual solution
0 references
numerical examples
0 references
nonlinear function minimization
0 references
integer programming
0 references
0 references
0 references
