Binary Quadratic Programming Relaxation

what is the best solver to solve Binary Quadratic Programming Problem in Matlab, and is it neccessary to relax the {0,1} to solve it.

Knowng that my problem has linear equality and linear inequality constraints (the constraints are linear).

Answer 1

[John D'Errico]

While you could just use a tool like quadprog with continuous varibles in the interval [0,1], then round the result at the end, but there is no assurance the result is then optimal. And if you do round the solution at the end, it will probably no longer even satisfy the eqaulity constraints. So you would just be wasting your time.

Therefore GA is probably your main choice, with binary variables and a quadratic objective.

[Mohammad Al ja'idi]

you mean no need to relax the variables {0,1} using for example positive semidefinite programming (PSD) technique. you recommend just using GA to solve the problem.

[Mohammad Al ja'idi]

Sorry for bothering, but do you see if I use quadprog to solve the problem with binary values {0,1} will get better result than making relaxaion of the variabls 0,1