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
專家
已審閱 6 天前
  • 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.

您尚未登入。 登入 去張貼答案。

一個好的回答可以清楚地回答問題並提供建設性的意見回饋,同時有助於提問者的專業成長。

回答問題指南