Binary Quadratic Programming Relaxation
3 次查看(过去 30 天)
显示 更早的评论
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).
0 个评论
回答(1 个)
John D'Errico
2020-7-12
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.
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Quadratic Programming and Cone Programming 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!