Using Branch and Bound Algorithm to solve Discrete Binary Quadratic Programming (QP) problem

2 次查看（过去 30 天）
Mohammad Al ja'idi
Mohammad Al ja'idi 2020-11-8
编辑： Matt J 2020-11-8
Dear all,
Can I use the branch and bound algorithm to solve my problem ((Discrete Binary Quadratic Programming (QP) problem)) in Matlab, if yes, what is the name of function (solver) that I can use in Matlab??
if no, Does GA is an effective algorithm that can I use to solve my problem?
please send me useful documentation for this

请先登录，再回答此问题。

采纳的回答

Matt J
Matt J 2020-11-8
编辑：Matt J 2020-11-8
Can I use the branch and bound algorithm to solve my problem ((Discrete Binary Quadratic Programming (QP) problem)) in Matlab
No, except in the special case where your QP is also an LP. In that case, use intlinprog.
if no, Does GA is an effective algorithm that can I use to solve my problem?
The only way to find out is to try.
  2 个评论
Mohammad Al ja'idi
Mohammad Al ja'idi 2020-11-8
Dear MAtt,
The problem that I am working on as follows:
  1. The objective function is Quadratic
  2. all constraints are linear.
  3. The vaviables are discrete binary (0 or 1 only).
Do you see my problem as Quadratic programming (QP)problem and also Linear Programming (LP)?
Thanks,
MK
Matt J
Matt J 2020-11-8
编辑：Matt J 2020-11-8
A linear program is a special case of a quadratic program, just as a linear function is a special case of a quadratic function, one with zero curvature.

请先登录，再进行评论。

更多回答（0 个）

类别

在 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!

Translated by