A note on solving quadratic programs using mixed-integer programming

DOI10.1016/0305-0548(89)90010-5zbMath0664.90068OpenAlexW2003246387MaRDI QIDQ1115803

Antonie Stam, Cliff T. Ragsdale

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90010-5

zbMATH Keywords

Kuhn-Tucker optimality conditionslinear complementarymixed-integer formulation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Uses Software

• MINOS

Cites Work

• The Simplex Method for Quadratic Programming
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Direct algorithms in quadratic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on solving quadratic programs using mixed-integer programming