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

4 views (last 30 days)
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

Accepted Answer

Matt J
Matt J on 8 Nov 2020
Edited: Matt J on 8 Nov 2020
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 Comments
Mohammad Al ja'idi
Mohammad Al ja'idi on 8 Nov 2020
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 on 8 Nov 2020
Edited: Matt J on 8 Nov 2020
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.

Sign in to comment.

More Answers (0)

Categories

Find more on Quadratic Programming and Cone Programming in Help Center and File Exchange

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!