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

DOI10.1007/BF02283693zbMath0719.90050OpenAlexW2052220497MaRDI QIDQ2640438

Christian Larsen, Faiz A. Al-Khayyal

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1007/bf02283693

zbMATH Keywords

global solutionbranch and boundrelaxationNP-hardunderestimationmixed integer nonconvex quadratic program

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

A relaxation method for nonconvex quadratically constrained quadratic programs ⋮ Optimization of a quadratic function with a circulant matrix ⋮ A reformulation-convexification approach for solving nonconvex quadratic programming problems ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ Generalized bilinear programming. I: Models, applications and linear programming relaxation ⋮ A new reformulation-linearization technique for bilinear 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

This page was built for publication: Global optimization of a quadratic function subject to a bounded mixed integer constraint set