Non-linear integer programming: Sensitivity analysis for branch and bound

DOI10.1016/0167-6377(87)90041-1zbMath0637.90066OpenAlexW2056648106MaRDI QIDQ1099075

Jadranka Skorin-Kapov, Frieda Granot

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90041-1

zbMATH Keywords

nonlinear integer programmingsensitivity analysisbranch and boundperturbed problemimplicit enumeration tree

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items (2)

Multiple cost coefficients sensitivity theorems of integer linear optimization ⋮ Challenges in Enterprise Wide Optimization for the Process Industries

Cites Work

• Unnamed Item
• A Duality Theorem for Convex Programs
• Duality in quadratic programming
• Sensitivity Analysis for Branch and Bound Integer Programming
• A duality theorem for non-linear programming
• Finding All Solutions for a Class of Parametric Quadratic Integer Programming Problems
• Postoptimality analysis in nonlinear integer programming: The right-hand side case
• Quadratic Binary Programming with Application to Capital-Budgeting Problems

This page was built for publication: Non-linear integer programming: Sensitivity analysis for branch and bound