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

From MaRDI portal
Revision as of 11:42, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2640438


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)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2640438&oldid=15455800"
Powered by MediaWiki