Is it possible for QBSolve to return an infeasible solution to the problem, even though matrix Q is guaranteed to be correct?

0

I'm modeling a QUBO problem, using D-Wave's QBSolve to return a solution to an original optimization problem P, and I'm aware that matrix Q matches problem P perfectly. I already know that QBSolve doesn't guarantee optimality, but it can return viable solutions. However, I'm coming across infeasible solutions. Is it possible for QBSolve to return an infeasible solution to the problem, even though matrix Q is guaranteed to be correct? If yes, why does this happen? And what are the current alternatives for working with huge matrices that only return viable solutions to the problem? I'm waiting for an answer to my question.

已提问 2 年前264 查看次数
1 回答
1
已接受的回答

Hello! QBSolv is now deprecated and it is recommended by D-Wave to use dwave-hybrid.

QBSolv makes uses of the tabu algorithm when running on classical solvers. More information can be found on the docs. Infeasible solutions have not been reported before but I would recommend looking into dwave-hybrid. Let us know if this answers your question!

AWS
Abe C
已回答 2 年前
profile picture
专家
已审核 5 天前
  • Thanks for your response. In light of current dwave-hybrid approaches, I have used the D-wave Simulator for simulated annealing (neal - https://docs.ocean.dwavesys.com/projects/neal/en/latest/reference/sampler.html). Like QBSolv, it is also returning infeasible solutions. In the case of D-wave simulators, are they suitable for large problems, and can they produce unfeasible solutions? I'm sure I'm working with the correct QUBO array for the problem.

您未登录。 登录 发布回答。

一个好的回答可以清楚地解答问题和提供建设性反馈,并能促进提问者的职业发展。

回答问题的准则