Global optimization of a quadratic function subject to a bounded mixed integer constraint set

DOI10.1007/BF02283693zbMath0719.90050MaRDI QIDQ2640438

Christian Larsen, Faiz A. Al-Khayyal

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

global solution; branch and bound; relaxation; NP-hard; underestimation; mixed integer nonconvex quadratic program

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C26: Nonconvex programming, global optimization

90C20: Quadratic programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Two-stage quadratic integer programs with stochastic right-hand sides, Optimization of a quadratic function with a circulant matrix, Generalized bilinear programming. I: Models, applications and linear programming relaxation, A new reformulation-linearization technique for bilinear programming problems, A relaxation method for nonconvex quadratically constrained quadratic programs, A reformulation-convexification approach for solving nonconvex quadratic programming problems, A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming

Cites Work

• Unnamed Item
• Unnamed Item
• The perfectly matchable subgraph polytope of an arbitrary graph
• Jointly constrained bilinear programs and related problems: An overview
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• Constrained global optimization: algorithms and applications
• An algorithm for indefinite integer quadratic programming
• The perfectly matchable subgraph polytope of a bipartite graph
• Jointly Constrained Biconvex Programming
• Improved algorithm for mixed-integer quadratic programs and a computational study
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• The Indefinite Quadratic Programming Problem