The Indefinite Quadratic Programming Problem
From MaRDI portal
Publication:4197634
DOI10.1287/opre.27.3.516zbMath0409.90070MaRDI QIDQ4197634
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.3.516
Cuts; Numerical Examples; Bender's Decomposition Principle; E- Convergent Methods; Indefinite Quadratic Programming
90C20: Quadratic programming
Related Items
On the global minimization of concave functions, Global optimization algorithms for linearly constrained indefinite quadratic problems, Jointly constrained bilinear programs and related problems: An overview, Global minimization of indefinite quadratic problems, Reduction of indefinite quadratic programs to bilinear programs, A branch bound method for subset sum problem, A reformulation-convexification approach for solving nonconvex quadratic programming problems, A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, A decomposition approach for global optimum search in QP, NLP and MINLP problems, Global optimization of a quadratic function subject to a bounded mixed integer constraint set, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, A finite cutting plane method for facial disjunctive programs
