Non-linear integer programming: Sensitivity analysis for branch and bound (Q1099075)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Non-linear integer programming: Sensitivity analysis for branch and bound |
scientific article; zbMATH DE number 4039638
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-linear integer programming: Sensitivity analysis for branch and bound |
scientific article; zbMATH DE number 4039638 |
Statements
Non-linear integer programming: Sensitivity analysis for branch and bound (English)
0 references
1987
0 references
We consider the nonlinear integer programming problem with varying right hand side and objective function coefficients. We establish what additional information to keep in the implicit enumeration tree, when solving the original problem, in order to provide us with bounds on the optimal value of a perturbed problem. The results obtained are extensions of the results given by \textit{L. Schrage} and \textit{L. Wolsey} [Oper. Res. 33, 1008-1023 (1985; Zbl 0583.90074)] for linear integer programs.
0 references
sensitivity analysis
0 references
branch and bound
0 references
nonlinear integer programming
0 references
implicit enumeration tree
0 references
perturbed problem
0 references
0.95577663
0 references
0.92522657
0 references
0.90772504
0 references
0.9057942
0 references
0.9049108
0 references
0.90490335
0 references
0.89812785
0 references
