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.

로그인하지 않았습니다. 로그인해야 답변을 게시할 수 있습니다.

좋은 답변은 질문에 명확하게 답하고 건설적인 피드백을 제공하며 질문자의 전문적인 성장을 장려합니다.

질문 답변하기에 대한 가이드라인

관련 콘텐츠