Non-linear integer programming: Sensitivity analysis for branch and bound
type: Item
instance of: scholarly article
title: Non-linear integer programming: Sensitivity analysis for branch and bound
zbMATH Open document ID: 0637.90066
DOI: 10.1016/0167-6377(87)90041-1
author: Jadranka Skorin-Kapov
author: Frieda Granot
published in: Operations Research Letters
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 4039638
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: branch and bound
zbMATH Keywords: nonlinear integer programming
zbMATH Keywords: implicit enumeration tree
zbMATH Keywords: perturbed problem
MaRDI profile type: Publication
full work available at URL: 0167-6377(87)90041-1
OpenAlex ID: W2056648106
cites work: Postoptimality analysis in nonlinear integer programming: The right-hand side case
cites work: A Duality Theorem for Convex Programs
cites work: Duality in quadratic programming
cites work: Q5613011
cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems
cites work: Finding All Solutions for a Class of Parametric Quadratic Integer Programming Problems
cites work: Sensitivity Analysis for Branch and Bound Integer Programming
cites work: A duality theorem for non-linear programming
Recommended article: Sensitivity Analysis for Branch and Bound Integer Programming
Recommended article: Sensitivity analysis for non-linear programs with linear constraints
Recommended article: A branch and bound algorithm for solving a class of nonlinear integer programming problems
Recommended article: Sensitivity Analysis for Nonlinear Programs and Variational Inequalities with Nonunique Multipliers
Recommended article: Sensitivity and stability analysis for nonlinear programming
Recommended article: Generalized Sensitivity Analysis of Nonlinear Programs
Recommended article: Q3682243
Recommended article: Sensitivity theorems in integer linear programming
Recommended article: Q3347632
Recommended article: Branch and Bound Experiments in Convex Nonlinear Integer Programming
description: scientific article; zbMATH DE number 4039638