Improved algorithm for mixed-integer quadratic programs and a computational study
From MaRDI portal
Publication:3720300
DOI10.1007/BF01585661zbMath0591.90066MaRDI QIDQ3720300
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
relaxation processBenders' decompositionmixed integer quadratic programmingnonsingular transformationComputational resultsquadratic duality theory
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)
Related Items (14)
Solving mixed integer nonlinear programs by outer approximation ⋮ Global optimization of a quadratic function subject to a bounded mixed integer constraint set ⋮ An algorithm for indefinite integer quadratic programming ⋮ A new local and global optimization method for mixed integer quadratic programming problems ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ A note on Benders' decomposition in mixed-integer quadratic programming ⋮ Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems ⋮ Models and methods of solution of quadratic integer programming problems ⋮ Decomposition in general mathematical programming ⋮ Optimal design of a distributed network with a two-level hierarchical structure ⋮ Dorn's duality for quadratic programs revisited: The nonconvex case ⋮ A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming ⋮ Global hybrid modeling and control of a buck converter: A novel concept ⋮ Orthogonal drawings of graphs with vertex and edge labels
Cites Work
This page was built for publication: Improved algorithm for mixed-integer quadratic programs and a computational study